Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives

Authors:
Leonidas J. Guibas;David Salesin;Jorge Stolfi
Affiliations:
-;-;-
Venue:
SIGAL '90 Proceedings of the International Symposium on Algorithms
Year:
1990

Citing 0
Cited 4

Classroom examples of robustness problems in geometric computations

Computational Geometry: Theory and Applications
Approximating largest convex hulls for imprecise points

Journal of Discrete Algorithms
Delaunay triangulation of imprecise points in linear time after preprocessing

Computational Geometry: Theory and Applications
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice

Quantified Score

Hi-index	0.00

Visualization

Abstract