 |
 |
 |
|
|
||
|---|---|---|
| inria-00537532v1
Conference papers
Skeletal Reconstruction of Branching Shapes Implicit Surfaces, Oct 1996, Eindhoven, Netherlands. pp.127--142 |
||
| inria-00537528v1
Journal articles
Skeletal Reconstruction of Branching Shapes Computer Graphics Forum, Wiley, 1997, 16 (5), pp.283--293. ⟨10.1111/1467-8659.00195⟩ |
||
| inria-00072355v1
Reports
Complexity of the Delaunay triangulation of points on polyhedral surfaces RR-4232, INRIA. 2001 |
||
| hal-02375564v1
Conference papers
Topological Quadrangulations of Closed Triangulated Surfaces Using the Reeb Graph Digital Geometry for Computer Imagery (DGCI), 2002, Bordeaux, France. pp.57-68, ⟨10.1007/3-540-45986-3_5⟩  |
||
| inria-00072135v1
Reports
A Linear Bound on the Complexity of the Delaunay triangulation of points on polyhedral surfaces [Research Report] RR-4453, INRIA. 2002 |
||
| inria-00001143v1
Journal articles
Topological Quadrangulations of Closed Triangulated Surfaces using the Reeb Graph Graphical Models, Elsevier, 2003, Special issue: Discrete Topology and Geometry for Image and Object Representation, 65 (1-3), pp.131-148 |
||
| inria-00001144v1
Conference papers
Detection of Constrictions on Closed Polyhedral Surfaces Eurographics/IEEE TCVG Visualisation Symposium, G.-P. Bonneau, S. Hahmann, C. Hansen, May 2003, Grenoble, France, France. pp.67-74 |
||
| inria-00001145v1
Conference papers
From a Closed Piecewise Geodesic to a Constriction on a Closed Triangulated Surface Pacific Graphics Conference on Computer Graphics and Applications, J. Rokne, Oct 2003, Canmore, Alberta, Canada, France. pp.394-398 |
||
| inria-00098300v2
Reports
Complexity of Delaunay triangulation for points on lower-dimensional~polyhedra [Research Report] RR-5986, INRIA. 2006, pp.12 |
||
| inria-00182835v2
Conference papers
Complexity of Delaunay Triangulation for Points on Lower-dimensional~Polyhedra Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, Jan 2007, New Orleans, United States. pp.1106--1113 |
||
| inria-00277899v2
Reports
A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron [Research Report] RR-6522, -; INRIA. 2008 |
||
| hal-02293165v1
Conference papers
Persistence-sensitive simplication of functions on surfaces in linear time TopoInVis'09, 2009, Salt Lake City, United States |
||
| hal-00468690v1
Book sections
Stability and Computation of Medial Axes: a State-of-the-Art Report T. M\"ller and B. Hamann and R. Russell. Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, Springer-Verlag, pp.109-125, 2009, Mathematics and Visualization |
||
| inria-00438409v1
Reports
The Effect of Noise on the Number of Extreme Points [Research Report] RR-7134, INRIA. 2009, pp.24 |
||
| hal-00761208v1
Reports
Homological reconstruction and simplification in R3 [Research Report] RR-8169, INRIA. 2012 |
||
| hal-00784900v1
Journal articles
A tight bound for the Delaunay triangulation of points on a polyhedron Discrete and Computational Geometry, Springer Verlag, 2012, 48 (1), pp.19-38. ⟨10.1007/s00454-012-9415-7⟩ |
||
| hal-00833791v1
Conference papers
Homological Reconstruction and Simplification in R3 Proceedings of the 29th Annual Symposium on Computational Geometry, Jun 2013, Rio de Janeiro, Brazil. pp.117-125, ⟨10.1145/2462356.2462373⟩ |
||
| hal-01015747v1
Conference papers
Recognizing shrinkable complexes is NP-complete Proceedings of the 22nd European Symposium on Algorithms, 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩ |
||
| hal-01132440v1
Journal articles
Homological Reconstruction and Simplification in R3 Computational Geometry, Elsevier, 2015, 48 (8), pp.606-621. ⟨10.1016/j.comgeo.2014.08.010⟩ |
||
| hal-01384396v2
Journal articles
Recognizing Shrinkable Complexes Is NP-Complete Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (1), pp.430--443. ⟨10.20382/jocg.v7i1a18⟩ |
||
|
|
||