Jean-Daniel Boissonnat

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

On Edge Collapse of Random Simplicial Complexes.

[BibT_eX]

[DOI]

Soumik Dutta

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

The reach of subsets of manifolds.

[BibT_eX]

[DOI]

J. Appl. Comput. Topol., September, 2023

Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter-Freudenthal-Kuhn Triangulations.

[BibT_eX]

[DOI]

Siargey Kachanovich

SIAM J. Comput., April, 2023

Local Criteria for Triangulating General Manifolds.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2023

Strong Collapse of Random Simplicial Complexes.

[BibT_eX]

[DOI]

Soumik Dutta

CoRR, 2023

Dimensionality Reduction for Persistent Homology with Gaussian Kernels.

[BibT_eX]

[DOI]

CoRR, 2023

2021

Triangulating Submanifolds: An Elementary and Quantified Version of Whitney's Method.

[BibT_eX]

[DOI]

Siargey Kachanovich

Discret. Comput. Geom., 2021

Local Conditions for Triangulating Submanifolds of Euclidean Space.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

Tracing Isomanifolds in ℝ^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.

[BibT_eX]

[DOI]

Siargey Kachanovich

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

The Topological Correctness of PL-Approximations of Isomanifolds.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Edge Collapse and Persistence of Flag Complexes.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Dimensionality Reduction for k-Distance Applied to Persistent Homology.

[BibT_eX]

[DOI]

Shreya Arya

Martin Lotz

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets.

[BibT_eX]

[DOI]

Marc Glisse

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Computing Persistent Homology of Flag Complexes via Strong Collapses.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Delaunay Triangulation of Manifolds.

[BibT_eX]

[DOI]

Found. Comput. Math., 2018

An Obstruction to Delaunay Triangulations in Riemannian Manifolds.

[BibT_eX]

[DOI]

Nikolay Martynchuk

Discret. Comput. Geom., 2018

Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set.

[BibT_eX]

[DOI]

Sudeshna Kolay

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Strong Collapse for Persistence.

[BibT_eX]

[DOI]

Divyansh Pareek

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.

[BibT_eX]

[DOI]

André Lieutier

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Local Criteria for Triangulation of Manifolds.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Only distances are required to reconstruct submanifolds.

[BibT_eX]

[DOI]

Steve Y. Oudot

Comput. Geom., 2017

An Efficient Representation for Filtrations of Simplicial Complexes.

[BibT_eX]

[DOI]

Karthik C. S.

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Kernelization of the Subset General Position Problem in Geometry.

[BibT_eX]

[DOI]

Sudeshna Kolay

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.

[BibT_eX]

[DOI]

Mael Rouxel-Labbé

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

On the complexity of the representation of simplicial complexes by trees.

[BibT_eX]

[DOI]

Dorian Mazauric

Theor. Comput. Sci., 2016

2015

CGALmesh: A Generic Framework for Delaunay Mesh Generation.

[BibT_eX]

[DOI]

Clément Jamin

Pierre Alliez

ACM Trans. Math. Softw., 2015

Anisotropic Delaunay Meshes of Surfaces.

[BibT_eX]

[DOI]

Kan-Le Shi

Jane Tournois

ACM Trans. Graph., 2015

Anisotropic Delaunay Mesh Generation.

[BibT_eX]

[DOI]

Camille Wormser

SIAM J. Comput., 2015

Tangent space variation on submanifolds.

[BibT_eX]

[DOI]

CoRR, 2015

A probabilistic approach to reducing the algebraic complexity of computing Delaunay triangulations.

[BibT_eX]

[DOI]

CoRR, 2015

A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

Building Efficient and Compact Data Structures for Simplicial Complexes.

[BibT_eX]

[DOI]

Karthik C. S.

Sébastien Tavenas

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Delaunay stability via perturbations.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

The Gudhi Library: Simplicial Complexes and Persistent Homology.

[BibT_eX]

[DOI]

Marc Glisse

Proceedings of the Mathematical Software - ICMS 2014, 2014

Computing Persistent Homology with Various Coefficient Fields in a Single Pass.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

The stability of Delaunay Triangulations.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2013

Constructing Intrinsic Delaunay Triangulations of Submanifolds

[BibT_eX]

[DOI]

CoRR, 2013

The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology.

[BibT_eX]

[DOI]

Tamal K. Dey

Proceedings of the Algorithms - ESA 2013, 2013

2012

The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

Stability of Delaunay-type structures for manifolds: [extended abstract].

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2010

Triangulating Smooth Submanifolds with Light Scaffolding.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2010

Manifold reconstruction using tangential Delaunay complexes.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Geometric tomography with topological guarantees.

[BibT_eX]

[DOI]

Omid Amini

Pooran Memari

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Feature preserving Delaunay mesh generation from 3D multi-material images.

[BibT_eX]

[DOI]

Dobrina Boltcheva

Comput. Graph. Forum, 2009

Mesh Generation from 3D Multi-material Images.

[BibT_eX]

[DOI]

Dobrina Boltcheva

Proceedings of the Medical Image Computing and Computer-Assisted Intervention, 2009

Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension.

[BibT_eX]

[DOI]

Samuel Hornus

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Stability and Computation of Medial Axes - a State-of-the-Art Report.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

Proceedings of the Mathematical Foundations of Scientific Visualization, 2009

2008

Provably Good 2D Shape Reconstruction from Unorganized Cross-Sections.

[BibT_eX]

[DOI]

Pooran Memari

Comput. Graph. Forum, 2008

From Segmented Images to Good Quality Meshes Using Delaunay Refinement.

[BibT_eX]

[DOI]

Proceedings of the Emerging Trends in Visual Computing, 2008

Locally uniform anisotropic meshing.

[BibT_eX]

[DOI]

Camille Wormser

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Skeletal Structures.

[BibT_eX]

[DOI]

Silvia Biasotti

Gabriella Sanniti di Baja

Herbert Edelsbrunner

Gershon Elber

Michela Mortara

Michela Spagnuolo

Mirela Tanase

Remco C. Veltkamp

Proceedings of the Shape Analysis and Structuring, 2008

2007

Bregman Voronoi Diagrams: Properties, Algorithms and Applications

[BibT_eX]

[DOI]

Frank Nielsen

Richard Nock

CoRR, 2007

Learning smooth shapes by probing.

[BibT_eX]

[DOI]

Leonidas J. Guibas

Comput. Geom., 2007

A Lagrangian Approach to Dynamic Interfaces through Kinetic Triangulation of the Ambient Space.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2007

On Bregman Voronoi diagrams.

[BibT_eX]

[DOI]

Frank Nielsen

Richard Nock

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Shape reconstruction from unorganized cross-sections.

[BibT_eX]

[DOI]

Pooran Memari

Proceedings of the Fifth Eurographics Symposium on Geometry Processing, Barcelona, 2007

High-Quality Consistent Meshing of Multi-label Datasets.

[BibT_eX]

[DOI]

Florent Ségonne

Laurent Rineau

Renaud Keriven

Proceedings of the Information Processing in Medical Imaging, 2007

Delaunay Deformable Models: Topology-Adaptive Meshes Based on the Restricted Delaunay Triangulation.

[BibT_eX]

[DOI]

Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), 2007

Visualizing bregman voronoi diagrams.

[BibT_eX]

[DOI]

Frank Nielsen

Richard Nock

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Manifold reconstruction in arbitrary dimensions using witness complexes.

[BibT_eX]

[DOI]

Leonidas J. Guibas

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

A Disk-Covering Problem with Application in Optical Interferometry.

[BibT_eX]

[DOI]

Trung Nguyen

Frédéric Falzon

Christian Knauer

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Jack Snoeyink

Discret. Comput. Geom., 2006

Editorial.

[BibT_eX]

[DOI]

Jack Snoeyink

Comput. Geom., 2006

Pupil Configuration for Extended Source Imaging with Optical Interferometry: a Computational Geometry Approach.

[BibT_eX]

[DOI]

Trung Nguyen

Philippe Blanc

Frédéric Falzon

Eric Thomas

Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

Provably good sampling and meshing of Lipschitz surfaces.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

From arteriographies to computational flow in saccular aneurisms: the INRIA experience.

[BibT_eX]

[DOI]

Medical Image Anal., 2005

Provably good sampling and meshing of surfaces.

[BibT_eX]

[DOI]

Graph. Model., 2005

Convex Hull and Voronoi Diagram of Additively Weighted Points.

[BibT_eX]

[DOI]

Christophe Delage

Proceedings of the Algorithms, 2005

Learning smooth objects by probing.

[BibT_eX]

[DOI]

Leonidas J. Guibas

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Anisotropic Diagrams: Labelle Shewchuk approach revisited.

[BibT_eX]

[DOI]

Camille Wormser

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Special Issue on WAFR 2002.

[BibT_eX]

[DOI]

Kenneth Y. Goldberg

Seth Hutchinson

Joel W. Burdick

Int. J. Robotics Res., 2004

A coordinate system associated with points scattered on a surface.

[BibT_eX]

[DOI]

Julia Flötotto

Comput. Aided Des., 2004

Isotopic implicit surface meshing.

[BibT_eX]

[DOI]

David Cohen-Steiner

Gert Vegter

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

An effective condition for sampling surfaces with guarantees.

[BibT_eX]

[DOI]

Proceedings of the Ninth ACM Symposium on Solid Modeling and Applications, 2004

2003

A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2003

Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres.

[BibT_eX]

[DOI]

Menelaos I. Karavelas

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Provably Good Surface Sampling and Approximation.

[BibT_eX]

[DOI]

Proceedings of the First Eurographics Symposium on Geometry Processing, 2003

Complexity of the delaunay triangulation of points on surfaces the smooth case.

[BibT_eX]

[DOI]

André Lieutier

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

Triangulations in CGAL.

[BibT_eX]

[DOI]

Comput. Geom., 2002

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon.

[BibT_eX]

[DOI]

Subir Kumar Ghosh

Telikepalli Kavitha

Algorithmica, 2002

A local coordinate system on a surface.

[BibT_eX]

[DOI]

Julia Flötotto

Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 2002

A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces.

[BibT_eX]

[DOI]

Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 2002

Conforming Orthogonal Meshes.

[BibT_eX]

[DOI]

Sophie Balaven

Chakib Bennis

Proceedings of the 11th International Meshing Roundtable, 2002

Computing the Diameter of a Point Set.

[BibT_eX]

[DOI]

Grégoire Malandain

Proceedings of the Discrete Geometry for Computer Imagery, 10th International Conference, 2002

2001

Natural neighbor coordinates of points on a surface.

[BibT_eX]

[DOI]

Comput. Geom., 2001

Coarse-to-fine surface simplification with geometric guarantees.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2001

Circular Separability of Polygons.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Algorithmica, 2001

2000

Robust Plane Sweep for Intersecting Segments.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Motion Planning of Legged Robots.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Planning and Simulation of Robotically Assisted Minimal Invasive Surgery.

[BibT_eX]

[DOI]

Louaï Adhami

Ève Coste-Manière

John Kenneth Salisbury Jr.

Proceedings of the Medical Image Computing and Computer-Assisted Intervention, 2000

Optimized Port Placement for the Totally Endoscopic Coronary Artery Bypass Grafting using the da Vinci Robotic System.

[BibT_eX]

[DOI]

Ève Coste-Manière

Louaï Adhami

Renaud Severac-Bastide

Adrian Lobontiu

Proceedings of the Experimental Robotics VII [ISER 2000, 2000

Voronoi-Based Systems of Coordinates and Surface Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

2D-Structure Drawings of Similar Molecules.

[BibT_eX]

[DOI]

Julia Flötotto

Proceedings of the Graph Drawing, 8th International Symposium, 2000

Triangulations in CGAL (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Smooth surface reconstruction via natural neighbour interpolation of distance functions.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments.

[BibT_eX]

[DOI]

Antoine Vigneron

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates.

[BibT_eX]

[DOI]

Jack Snoeyink

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Programming with CGAL: The Example of Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Slicing Minkowski sums for satellite antenna layout.

[BibT_eX]

[DOI]

Eelco de Lange

Comput. Aided Des., 1998

Reconstruction of 3D colored Data.

[BibT_eX]

[DOI]

Stéphane Nullans

Proceedings of the 19th Annual Conference of the European Association for Computer Graphics, 1998

Algorithmic geometry.

[BibT_eX]

Cambridge University Press, ISBN: 978-0-521-56529-5, 1998

1997

On Computing Four-Finger Equilibrium and Force-Closure Grasps of Polyhedral Objects.

[BibT_eX]

[DOI]

Jean Ponce

Steve Sullivan

Attawith Sudsang

Jean-Pierre Merlet

Int. J. Robotics Res., 1997

Evaluating Signs of Determinants Using Single-Precision Arithmetic.

[BibT_eX]

[DOI]

Algorithmica, 1997

Minkowski Operations for Satellite Antenna Layout.

[BibT_eX]

[DOI]

Eelco de Lange

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes.

[BibT_eX]

[DOI]

André Cérézo

Int. J. Comput. Geom. Appl., 1996

An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D.

[BibT_eX]

[DOI]

Comput. Geom., 1996

Reconstruction of Geological Structures from Heterogeneous and Sparse Data.

[BibT_eX]

[DOI]

Stéphane Nullans

Proceedings of the GIS '96, 1996

A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Convex Hulls of Bounded Curvature.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Computing Largest Circles Separating Two Sets of Segments.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Motion planning of legged robots: the spider robot problem.

[BibT_eX]

[DOI]

LeonBattista Donati

Int. J. Comput. Geom. Appl., 1995

On-line Construction of the Upper Envelope of Triangles and Surface Patches in Three Dimensions.

[BibT_eX]

[DOI]

Katrin Dobrindt

Comput. Geom., 1995

Circular Separability of Polygon.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions.

[BibT_eX]

[DOI]

Micha Sharir

Boaz Tagansky

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

A Global Motion Planner for a Mobile Robot on a Terrain.

[BibT_eX]

[DOI]

Katrin Dobrindt

Bernhard Geiger

Henri Michel

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Evaluation of a New Method to Compute Signs of Determinants.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Shortest Path Synthesis for Dubins Non-Holonomic Robot.

[BibT_eX]

[DOI]

Xuân-Nam Bui

Philippe Souères

Jean-Paul Laumond

Proceedings of the 1994 International Conference on Robotics and Automation, 1994

From Spider Robots to Half Disk Robots.

[BibT_eX]

[DOI]

Proceedings of the 1994 International Conference on Robotics and Automation, 1994

Convex Tours on Bounded Curvature.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

On the Randomized Construction of the Delaunay Tree.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis.

[BibT_eX]

[DOI]

Algorithmica, 1993

3D Simulation of Delivery.

[BibT_eX]

[DOI]

Bernhard Geiger

Proceedings of the 4th IEEE Visualization Conference, 1993

On Characterizing and Computing Three- and Four-Finger Force-Closure Grasps of Polyhedral Objects.

[BibT_eX]

[DOI]

Jean Ponce

Steve Sullivan

Jean-Pierre Merlet

Proceedings of the 1993 IEEE International Conference on Robotics and Automation, 1993

1992

Applications of Random Sampling to On-line Algorithms in Computational Geometry.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

Probing a Scene of Nonconvex Polyhedra.

[BibT_eX]

[DOI]

Algorithmica, 1992

Some New Research Directions in Robot Motion Planning.

[BibT_eX]

Proceedings of the Algorithms, Software, Architecture, 1992

Motion planning for spider robots.

[BibT_eX]

[DOI]

LeonBattista Donati

Proceedings of the 1992 IEEE International Conference on Robotics and Automation, 1992

Stable Placements for Spider Robots.

[BibT_eX]

[DOI]

LeonBattista Donati

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

Automatic Modelling of Three-Dimensional Objects.

[BibT_eX]

[DOI]

Proceedings of the Concise Encyclopedia of Modelling & Simulation, 1992

1991

Computing the union of 3-colored triangles.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1991

An Optimal Algorithm for the Boundary of a Cell in a Union of Rays-Corrigendum.

[BibT_eX]

[DOI]

Algorithmica, 1991

Shortest paths of Bounded Curvature in the Plane.

[BibT_eX]

[DOI]

André Cérézo

Juliette Leblond

Proceedings of the Geometric Reasoning for Perception and Action, Workshop, 1991

1990

Non Convex Contour Reconstruction.

[BibT_eX]

[DOI]

J. Symb. Comput., 1990

1989

On the Boundary of a Union of Rays.

[BibT_eX]

[DOI]

Proceedings of the STACS 89, 1989

On the order induced by a set of rays: application to the probing of nonconvex polygons.

[BibT_eX]

[DOI]

Proceedings of the 1989 IEEE International Conference on Robotics and Automation, 1989

Probing a Scene of Non Convex Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Shape reconstruction from planar cross sections.

[BibT_eX]

[DOI]

Comput. Vis. Graph. Image Process., 1988

Polygon Placement Under Translation and Rotation.

[BibT_eX]

[DOI]

Proceedings of the STACS 88, 1988

Scene reconstruction from rays application to stereo data.

[BibT_eX]

[DOI]

Olivier Monga

Proceedings of the 1988 IEEE International Conference on Robotics and Automation, 1988

Representing stereo data with the Delaunay triangulation.

[BibT_eX]

[DOI]

Elisabeth Le Bras-Mehlman

Proceedings of the 1988 IEEE International Conference on Robotics and Automation, 1988

A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles.

[BibT_eX]

[DOI]

Bernard Faverjon

Proceedings of the 1988 IEEE International Conference on Robotics and Automation, 1988

A geometric approach to inspection.

[BibT_eX]

[DOI]

Elisabeth Le Bras-Mehlman

Proceedings of the 9th International Conference on Pattern Recognition, 1988

How the Delaunay Triangulation Can Be used For Representing Stereo Data.

[BibT_eX]

[DOI]

Michel Schmitt

Proceedings of the Second International Conference on Computer Vision, 1988

A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles.

[BibT_eX]

[DOI]

Bernard Faverjon

Proceedings of the Geometry and Robotics, 1988

An optimal algorithm for the boundary of a cell in a union of rays.

[BibT_eX]

[DOI]

Proceedings of the Geometry and Robotics, 1988

1987

Simultaneous Containment of Several Polygons.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

An Optimal O(n log n) Algorithm for Contour Reconstruction from Rays.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

The Hierarchical Representation of Objects: The Delaunay Tree.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

Reconstruction of solids.

[BibT_eX]

[DOI]

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Geometric Structures for Three-Dimensional Shape Representation.

[BibT_eX]

[DOI]

ACM Trans. Graph., 1984

Polyhedral approximation of 3-D objects without holes.

[BibT_eX]

[DOI]

Martial Hebert

Philippe Mussi

Comput. Vis. Graph. Image Process., 1984

1982

Stable Matching Between a Hand Structure and an Object Silhouette.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1982

1981

A New Approach to the Problem of Acquiring Randomly Oriented Workpieces Out of a Bin.

[BibT_eX]

F. Germain

Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

Triangulation of 3-D Objects.

[BibT_eX]