Dominique Schmitt

Orcid: 0000-0002-1606-8013

According to our database1, Dominique Schmitt authored at least 20 papers between 1993 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Optimal Area Polygonization by Triangulation and Visibility Search.
ACM J. Exp. Algorithmics, December, 2022

2021
Bivariate B-splines from convex configurations.
J. Comput. Syst. Sci., 2021

Separation by Convex Pseudo-Circles.
Discret. Comput. Geom., 2021

2020
Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Bivariate B-Splines from Convex Pseudo-circle Configurations.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2013
On Voronoi Diagrams in the Planar Line Space and Their Generalizations.
Trans. Comput. Sci., 2013

Araucaria Trees: Construction and Grafting Theorems.
Fundam. Informaticae, 2013

2012
On Voronoi Diagram in the Line Space and their Generalizations.
Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

2011
Centroid Triangulations from k-Sets.
Int. J. Comput. Geom. Appl., 2011

2008
Flip Algorithm for Segment Triangulations.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
Divide and Conquer Method for <i>k</i> -Set Polygons.
Proceedings of the Computational Geometry and Graph Theory, 2007

Two-dimensional line space Voronoi Diagram.
Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

Triangulations of Line Segment Sets in the Plane.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
<i>k</i>-Sets of Convex Inclusion Chains of Planar Point Sets.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

k-set polytopes and order-k Delaunay diagrams.
Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

1999
Angular Properties of Delaunay Diagrams in Any Dimension.
Discret. Comput. Geom., 1999

1998
Order-<i>k</i> Voronoi Diagrams, <i>k</i>-Sections, and <i>k</i>-Sets.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the plane.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1993
On Equiangularity of Delaunay Diagrams in Every Dimension.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993


  Loading...