Dominique Schmitt

Université de Haute-Alsace — France

Computer Science · Physical Sciences

6h-index81citations32works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(19), Digital Image Processing Techniques(8), French Urban and Social Studies(7), Advanced Numerical Analysis Techniques(6), Point processes and geometric inequalities(3)

Publications32 total

Optimal Area Polygonization by Triangulation and Visibility Search
ACM Journal of Experimental Algorithmics·2022· 2 cited
De la fonction publique territoriale à l’administration d’État : servir la République
Administration·2021
Bivariate B-splines from convex configurations
Journal of Computer and System Sciences·2021· 3 citedOpen Access
SARS-Cov-2 Seroprevalence in a French Kidney Transplant Center Located Within a “High-risk” Zone
Transplantation·2021Open Access
Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020Open Access
Separation by Convex Pseudo-Circles
Discrete & Computational Geometry·2020· 2 cited
Correction: An essential role of the mouse synapse-associated protein Syap1 in circuits for spontaneous motor activity and rotarod balance
Biology Open·2020Open Access
Bivariate B-Splines from Convex Pseudo-circle Configurations
Lecture notes in computer science·2019· 8 cited
Préfaces
Alpara eBooks·2017
k-Sets of Convex Inclusion Chains of Planar Point Sets
2015
Separation by Convex Pseudo-Circles
2014· 4 citedOpen Access
Araucaria Trees: Construction and Grafting Theorems
Fundamenta Informaticae·2013
On Voronoi Diagrams in the Planar Line Space and Their Generalizations
Lecture notes in computer science·2013· 1 cited
On Voronoi Diagram in the Line Space and their Generalizations
2012
CENTROID TRIANGULATIONS FROM k-SETS
International Journal of Computational Geometry & Applications·2011· 8 cited
The Number of k-Point Subsets Separable by Convex Pseudo-Circles
2011
Construction of the segment Delaunay triangulation by a flip algorithm
2008
Flip Algorithm for Segment Triangulations
Lecture notes in computer science·2008· 1 cited
Divide and Conquer Method for k-Set Polygons
Lecture notes in computer science·2008
Two-dimensional line space Voronoi Diagram
2007· 10 cited
page 1 of 2Next →

Frequent Co-authors

Jean-Claude Spehner(8), Nicolas Chevallier(5), Wael El Oraiby(4), Mathieu Brévilliers(2), Augustin Fruchard(2), Julien Lepagnot(2), Laurent Moalic(2), Kira Vyatkina(2), Jean Bouinot(2), Stéphane Rivière(1), Bruno Adam(1), Pierre Kauffmann(1), J Sommelet(1), Frederic Boileau(1), J Préaut(1), Julien Kritter(1), Cora R. von Collenberg(1), Thomas Rü licke(1), Michael Sendtner(1), Robert Blum(1)