Pseudo-triangulation
Pseudo-Triangulation is a partition of a planar point set or polygon into pseudo-triangles—polygons with exactly three convex vertices—such that the resulting structure satisfies combinatorial and geometric properties analogous to, yet more general than, those of a triangulation.
12
Publications
466
Citations
25
Authors
26
Institutions
Publications per year
2017–2026
0
Parents
12
Tight degree bounds for pseudo-triangulations of points
Lutz Kettner, David Kirkpatrick, Andrea Mantler et al. · Computational Geometry · 2003 · 29 citations
1–5 of 12
25
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 25
26
University of California, Santa Barbara
Santa Barbara, United States
3 h-index
3 publications
56 citations
ETH Zurich
Zurich, Switzerland
3 h-index
3 publications
60 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
2 h-index
3 publications
79 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
2 publications
38 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
38 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
1 publications
21 citations

Universidad de Cantabria
Santander, Spain
1 h-index
1 publications
21 citations
University of North Carolina Health Care
Chapel Hill, United States
1 h-index
2 publications
58 citations
1–8 of 26
1 publications · 25 citations
1
h-index
1 publications · 20 citations
1
h-index
1 publications · 43 citations
1
h-index
1 publications · 29 citations
1
h-index
SIGMA · 1 publications · 38 citations
1
h-index
1–5