A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS

DOI10.1142/S0218195994000100zbMath0820.68124WikidataQ59256050 ScholiaQ59256050MaRDI QIDQ4312276

Maurizio Talamo, Carlo Gaibisso, Giorgio Gambosi, Paolo Giulio Franciosa

Publication date: 6 November 1994

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

scalingcomputational geometrycomplexity analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Delaunay Triangulation of Imprecise Points Simplified and Extended ⋮ Convex hulls under uncertainty ⋮ Preprocessing imprecise points for Delaunay triangulation: simplified and extended ⋮ Minimizing Co-location Potential of Moving Entities

This page was built for publication: A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS