See this document in CiteSeerX!

Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic (1992)  (Make Corrections)  (27 citations)
Zhenyu Li, Victor Milenkovic
Symposium on Computational Geometry



  Home/Search   Context   Related

 
View or download:
miami.edu/~vjm/Papers/convex.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  miami.edu/~vjm/papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: One useful generalization of the convex hull of a set S of n points is the ffl-strongly convex ffi-hull. It is defined to be a convex polygon P with vertices taken from S such that no point in S lies farther than ffi outside P and such that even if the vertices of P are perturbed by as much as ffl, P remains convex. It was an open question 1 as to whether an ffl-strongly convex O(ffl)-hull existed for all positive ffl. We give here an O(n log n) algorithm for constructing it (which thus... (Update)

Context of citations to this paper:   More

.... can be obtained using only the inaccurate but fast arithmetic provided by AEoating point processors (see for examples [17, 18, 15, 13, 10, 11, 8]) Such solutions, although very useful in some domains like solid modeling and CSG applications, are still painful to...

.... problem [15, 18, 27, 36, 39] A popular approach to overcoming the robustness problem is the exact computation paradigm [1, 2, 4, 5, 9, 10, 7, 13, 25, 33, 40, 41]. The paradigm calls for the exact evaluations of all conditions and hence the exact computation of signs. In this...

Cited by:   More
The Implementation of Geometric Algorithms - Kurt Mehlhorn Stefan (1994)   (Correct)
Splitting a Complex of Convex Polytopes In Any Dimension - Bajaj, Pascucci (1996)   (Correct)
The LEDA class real number - Burnikel, Mehlhorn, Schirra (1996)   (Correct)

Active bibliography (related documents):   More   All
0.1:   Computing Convex Hull in Floating Point Arithmetic - Jaromczyk, Wasilkowski (1994)   (Correct)
0.1:   Robust Polygon Modeling - Milenkovic (1993)   (Correct)
0.1:   Approximate Data Structures with Applications (Extended.. - Matias, Vitter, Young (1994)   (Correct)

Similar documents based on text:   More   All
0.2:   Robust Geometric Computations for Vision and Robotics - Milenkovic (1989)   (Correct)
0.1:   Correctly Rounded Binary-Decimal and Decimal-Binary Conversions - Gay (1990)   (Correct)
0.1:   Snap Rounding Revisited - Packer, Halperin (2001)   (Correct)

Related documents from co-citation:   More   All
20:   Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithm.. (context) - Milenkovic - 1988
12:   Double precision geometry: a general technique for calculating line and segment .. - Milenkovic - 1989
11:   Epsilon geometry: Building robust algorithms from imprecise computations (context) - Guibas, Salesin et al. - 1989

BibTeX entry:   (Update)

LI, Z., AND MILENKOVIC, V. Constructing strongly convex hulls using exact or rounded arithmetic. In Proc. 6th Annu. ACM Sympos. Comput. Geom. (1990), pp. 235--243. http://citeseer.ist.psu.edu/li92constructing.html   More

@inproceedings{ li90constructing,
    author = "Zhenyu Li and Victor Milenkovic",
    title = "Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic",
    booktitle = "Symposium on Computational Geometry",
    pages = "235-243",
    year = "1990",
    url = "citeseer.ist.psu.edu/li92constructing.html" }
Citations (may not include all citations):
68   An Efficient Algorithm for Determining the Convex Hull of a .. (context) - Graham - 1972  DBLP
67   Verifiable Implementations of Geometric Algorithms using Fin.. (context) - Milenkovic - 1988  ACM   DBLP
59   Epsilon Geometry: Building Robust Algorithms from Imprecise .. (context) - Guibas, Salesin et al. - 1989  ACM   DBLP
36   Stable Maintenance of Point-Set Triangulation in Two Dimensi.. (context) - Fortune - 1989
36   Double Precision Geometry: A General Technique for Calculati.. - Milenkovic - 1989  DBLP
12   Calculating approximate curve arrangements using rounded ari.. - Milenkovic - 1989  ACM   DBLP
7   Constructing Strongly Convex Approximate Hulls with Inaccura.. (context) - Guibas, Salesin et al. - 1990  ACM   DBLP



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.miami.edu/~vjm/papers.html):   More
Rotational Polygon Overlap Minimization and Compaction - Milenkovic (1998)   (Correct)
Column-Based Strip Packing Using Ordered and Compliant.. - Daniels, al. (1996)   (Correct)
Multiple Translational Containment Part I: An Approximate.. - Daniels, Milenkovic (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC