default search action
Dominique Schmitt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j7]Julien Lepagnot
, Laurent Moalic
Optimal Area Polygonization by Triangulation and Visibility Search. ACM J. Exp. Algorithmics 27: 1-23 (2022) - 2021
- [j6]Nicolas Chevallier, Augustin Fruchard, Dominique Schmitt, Jean-Claude Spehner:
Separation by Convex Pseudo-Circles. Discret. Comput. Geom. 65(4): 1199-1231 (2021) - [j5]Dominique Schmitt:
Bivariate B-splines from convex configurations. J. Comput. Syst. Sci. 120: 42-61 (2021) - 2020
- [c14]Laurent Moalic
Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge). SoCG 2020: 84:1-84:9
2010 – 2019
- 2019
- [c13]Dominique Schmitt:
Bivariate B-Splines from Convex Pseudo-circle Configurations. FCT 2019: 335-349 - 2014
- [c12]Nicolas Chevallier, Augustin Fruchard, Dominique Schmitt, Jean-Claude Spehner:
Separation by Convex Pseudo-Circles. SoCG 2014: 444 - 2013
- [j4]Dominique Schmitt, Jean-Claude Spehner:
Araucaria Trees: Construction and Grafting Theorems. Fundam. Informaticae 123(4): 417-445 (2013) - [j3]Dominique Schmitt, Kira Vyatkina:
On Voronoi Diagrams in the Planar Line Space and Their Generalizations. Trans. Comput. Sci. 20: 170-180 (2013) - 2012
- [c11]Dominique Schmitt, Kira Vyatkina:
On Voronoi Diagram in the Line Space and their Generalizations. ISVD 2012: 122-125 - 2011
- [j2]Wael El Oraiby, Dominique Schmitt, Jean-Claude Spehner:
Centroid Triangulations from k-Sets. Int. J. Comput. Geom. Appl. 21(6): 635-659 (2011)
2000 – 2009
- 2008
- [c10]Mathieu Brévilliers, Nicolas Chevallier, Dominique Schmitt:
Flip Algorithm for Segment Triangulations. MFCS 2008: 180-192 - 2007
- [c9]Mathieu Brévilliers, Nicolas Chevallier, Dominique Schmitt:
Triangulations of Line Segment Sets in the Plane. FSTTCS 2007: 388-399 - [c8]Stéphane Rivière, Dominique Schmitt:
Two-dimensional line space Voronoi Diagram. ISVD 2007: 168-175 - [c7]Wael El Oraiby, Dominique Schmitt:
Divide and Conquer Method for k -Set Polygons. KyotoCGGT 2007: 166-177 - 2006
- [c6]Dominique Schmitt, Jean-Claude Spehner:
k-set polytopes and order-k Delaunay diagrams. ISVD 2006: 173-185 - [c5]Wael El Oraiby, Dominique Schmitt:
k-Sets of Convex Inclusion Chains of Planar Point Sets. MFCS 2006: 339-350
1990 – 1999
- 1999
- [j1]Dominique Schmitt, Jean-Claude Spehner:
Angular Properties of Delaunay Diagrams in Any Dimension. Discret. Comput. Geom. 21(1): 17-36 (1999) - 1998
- [c4]Bruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner:
A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the plane. CCCG 1998 - [c3]Dominique Schmitt, Jean-Claude Spehner:
Order-k Voronoi Diagrams, k-Sections, and k-Sets. JCDCG 1998: 290-304 - 1997
- [c2]Bruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner:
An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane. CCCG 1997 - 1993
- [c1]Dominique Schmitt, Jean-Claude Spehner:
On Equiangularity of Delaunay Diagrams in Every Dimension. CCCG 1993: 346-351
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: