An output sensitive algorithm for discrete convex hulls

DOI10.1016/S0925-7721(97)00031-XzbMath0896.68148MaRDI QIDQ1388138

Sariel Har-Peled

Publication date: 8 June 1998

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

convex hulldiscrete hull

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Lyndon + Christoffel = digitally convex ⋮ Guarding galleries and terrains ⋮ Euclidean farthest-point Voronoi diagram of a digital edge ⋮ Region-fault tolerant geometric spanners ⋮ On the complexity of randomly weighted multiplicative Voronoi diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of convex lattice polytopes
• A linear algorithm for determining the separation of convex polyhedra
• Data Structures for Retrieval on Square Grids
• SUBPIXEL IMAGE REGISTRATION USING CIRCULAR FIDUCIALS
• A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points

This page was built for publication: An output sensitive algorithm for discrete convex hulls