Implementing data-dependent triangulations with higher order Delaunay triangulations
Abstract
References
Index Terms
- Implementing data-dependent triangulations with higher order Delaunay triangulations
Recommendations
Flips in Higher Order Delaunay Triangulations
LATIN 2020: Theoretical InformaticsAbstractWe study the flip graph of higher order Delaunay triangulations. A triangulation of a set S of n points in the plane is order-k Delaunay if for every triangle its circumcircle encloses at most k points of S. The flip graph of S has one vertex for ...
Optimization for first order Delaunay triangulations
This paper discusses optimization of quality measures over first order Delaunay triangulations. Unlike most previous work, our measures relate to edge-adjacent or vertex-adjacent triangles instead of only to single triangles. We give efficient ...
Higher order Delaunay triangulations
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circle through its vertices contains no points of P inside, we require that at ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Other conferences](/cms/asset/e8d9f507-9f45-4d3c-b121-856ee87c6df8/2996913.cover.jpg)
- General Chairs:
- Mohamed Ali,
- Shawn Newsam,
- Program Chairs:
- Matthias Renz,
- Goce Trajcevski,
- Siva Ravada
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 104Total Downloads
- Downloads (Last 12 months)10
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in