AbstractIt is shown that, except for two well defined configurations, any finite set V ⊂ R2 with exactly three points on ∂V is the vertex set of a triangulation of [V] which is combinatorially the Schlegel diagram of a simplicial unstacked 3-polytope
Given a finite point set P in general position in the plane, a full triangulation is a maximal strai...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
AbstractThe classification of the 1296 (simplicial) 3-spheres with nine vertices into polytopal and ...
AbstractIt is shown that, except for two well defined configurations, any finite set V ⊂ R2 with exa...
AbstractFor some families of graphs of simplicial 3-polytopes with two types of edges structural pro...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
AbstractWe present a 3-diagram D with 8 vertices, which is not isomorphic to a Schiegel-diagram of a...
A triangulation of a finite point set A in IR d is a geometric simplicial complex which covers the c...
International audienceThis paper considers compact triangulated polyhedra of genus zero. Let V n = {...
AbstractWe give conditions under which a diagram R←gP→gQ of polyhedra and PL maps is triangulable. S...
SIGLEAvailable from TIB Hannover: F02B140 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technis...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
It is important to have fast and effective methods for simplifying 3-manifold triangulations without...
International audienceThe author studies (not necessarily convex) triangulated polyhedra in three-di...
Given a finite point set P in general position in the plane, a full triangulation is a maximal strai...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
AbstractThe classification of the 1296 (simplicial) 3-spheres with nine vertices into polytopal and ...
AbstractIt is shown that, except for two well defined configurations, any finite set V ⊂ R2 with exa...
AbstractFor some families of graphs of simplicial 3-polytopes with two types of edges structural pro...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
AbstractWe present a 3-diagram D with 8 vertices, which is not isomorphic to a Schiegel-diagram of a...
A triangulation of a finite point set A in IR d is a geometric simplicial complex which covers the c...
International audienceThis paper considers compact triangulated polyhedra of genus zero. Let V n = {...
AbstractWe give conditions under which a diagram R←gP→gQ of polyhedra and PL maps is triangulable. S...
SIGLEAvailable from TIB Hannover: F02B140 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technis...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
It is important to have fast and effective methods for simplifying 3-manifold triangulations without...
International audienceThe author studies (not necessarily convex) triangulated polyhedra in three-di...
Given a finite point set P in general position in the plane, a full triangulation is a maximal strai...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
AbstractThe classification of the 1296 (simplicial) 3-spheres with nine vertices into polytopal and ...
DOI
Add to ORKG