A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
DOI10.1142/S0218195994000100zbMATH Open0820.68124DBLPjournals/ijcga/FranciosaGGT94WikidataQ59256050 ScholiaQ59256050MaRDI QIDQ4312276FDOQ4312276
Authors: Carlo Gaibisso, Giorgio Gambosi, Maurizio Talamo, Paolo G. Franciosa 
Publication date: 6 November 1994
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (15)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier
- An efficient convex hull algorithm using affine transformation in planar point set
- Constructing strongly convex hulls using exact or rounded arithmetic
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Computing convex hull in a floating point arithmetic
- CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS
- Using interval arithmetic for determining the structure of convex hulls
- The implementation of an algorithm to find the convex hull of a set of three-dimensional points
- Minimizing co-location potential of moving entities
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Construction of the convex hull of a finite set of points when the computations are approximate
- New efficient approximate convex hull algorithm for very large planar point sets
- An algorithm to find the lineality space of the positive hull of a set of vectors
This page was built for publication: A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4312276)
