Structural tolerance and Delaunay triangulation

DOI10.1016/S0020-0190(99)00107-6zbMath0999.68220WikidataQ126537142 ScholiaQ126537142MaRDI QIDQ1606996

Ferran Hurtado, Manuel Abellanas, Pedro A. Ramos

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Delaunay triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items

POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES ⋮ Largest and smallest convex hulls for imprecise points ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Connectivity graphs of uncertainty regions ⋮ Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) ⋮ Largest convex hulls for constant size, convex-hull disjoint clusters ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs ⋮ SMOOTHING IMPRECISE 1.5D TERRAINS ⋮ Largest bounding box, smallest diameter, and related problems on imprecise points ⋮ Approximating Largest Convex Hulls for Imprecise Points ⋮ Approximating largest convex hulls for imprecise points ⋮ Delaunay triangulation of imprecise points in linear time after preprocessing ⋮ Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model

Cites Work

• Unnamed Item
• Some dynamic computational geometry problems
• Transitions in geometric minimum spanning trees
• Constructing strongly convex hulls using exact or rounded arithmetic
• On minimum and maximum spanning trees of linearly moving points
• Constructing strongly convex approximate hulls with inaccurate primitives
• Testing simple polygons.
• VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• Algorithms for Cluster Busting in Anchored Graph Drawing
• Approximation by circles

This page was built for publication: Structural tolerance and Delaunay triangulation