Arijit Ghosh

Reader F

Office Address 

Institute of Mathematical Sciences
Office Room No. 210
IV Cross Road, CIT Campus
Chennai 600113, Tamil Nadu 

INRIA Sophia Antipolis - Méditerranée
, France                                     Oct. 2008 - May 2012
Team Geometrica

        PhD in Computer Science
  •  Advisor: Jean-Daniel Boissonnat
  • Title: Piecewise linear reconstruction and meshing of submanifolds of Euclidean space

Indian Institute of Technology Kharagpur                                             July 2003 - June 2008
Department of Computer Science and Engineering

        Dual degree (Bachelor and Master of Technology) in Computer Science 

Research Interests

Broadly my research interests are in Theoretical Computer Science. I am currently looking into
  • Computational Geometry and Topology

  • Combinatorial Geometry

  • Applied Probability Theory

  • Optimization Problems in Geometry and Graph Theory
During my PhD I worked on manifold reconstruction from dense point sample, sampling and 
triangulating submanifolds, stability of Euclidean Delaunay triangulations and intrinsic Delaunay 
triangulation of smooth manifolds.

Recent teaching (full list available here)

Selected papers (full list available here)

  • Multiparameter continuation on manifolds with theoretical guarantees
  • Hitting Sets: A New Framework
  • Parameterized Query Complexity of Hitting Set using Stability of Sunflowers
  • FPT algorithms for Embedding into Low Complexity Graph Metrics
  • Local criteria for triangulation of manifolds
  • Tight Kernels for Covering with Points and Polynomials
  • Kernelization of the subset general position problem in geometry
  • Shallow packings, semialgebraic set systems, Macbeath regions and polynomial partitioning
    • with Bruno JartouxKunal Dutta and Nabil Hassan Mustafa
    • Full version invited to Discrete & Computational Geometry for the Special Issue of SoCG’17.
    • Proceedings of the 33rd International Symposium on Computational Geometry, SoCG, volume 77, pp. 38:1-38:15, 2017. [DOI]

  • Uniformity of point samples in metric spaces using gap ratio
  • An obstruction to Delaunay triangulations for Riemannian manifolds
  • Delaunay Triangulations of Manifolds
  • A Simple Proof of Optimal Epsilon Nets
  • On Subgraphs of Bounded Degeneracy in Hypergraphs
    • with Kunal Dutta.
    • Full version submitted to Combinatorics, Probability and Computing.
    • Proceedings of the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG, pp. 295-306, 2016. [DOI]

  • Two proofs for Shallow Packings
    • with Kunal Dutta and Esther Ezra
    • Discrete & Computational Geometry56(4): 910-939, 2016. [DOI]
    • Special Issue for SoCG'15.
    • Proceedings of the 31st International Symposium on Computational Geometry, SoCG, volume 34, pp. 96-110, 2015. [DOI]

  • A probabilistic approach to reducing algebraic complexity of computing Delaunay triangulations
  • Stability of Delaunay-type Structures for Manifolds
  • Manifold Reconstruction using Tangential Delaunay Complexes
    • with Jean-Daniel Boissonnat
    • Discrete & Computational Geometry, 51(1): 221-267, 2014. [DOI]
    • Proceedings of the 26th Annual ACM Symposium on Computational Geometry, SoCG, pp. 324-333, 2010. [DOI]

  • Piecewise linear reconstruction and meshing of submanifolds of Euclidean space