Constructing strongly convex hulls using exact or rounded arithmetic
- 1 December 1992
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 8 (1-6) , 345-364
- https://doi.org/10.1007/bf01758851
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Constructing strongly convex approximate hulls with inaccurate primitivesLecture Notes in Computer Science, 1990
- Epsilon geometry: building robust algorithms from imprecise computationsPublished by Association for Computing Machinery (ACM) ,1989
- Calculating approximate curve arrangements using rounded arithmeticPublished by Association for Computing Machinery (ACM) ,1989
- Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmeticPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Stable maintenance of point set triangulations in two dimensionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989