CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS

DOI10.1142/S0218195901000614zbMath1074.68633MaRDI QIDQ4682156

Kimio Kawaguchi, Koichi Wada, Xiaowen Deng, Wei Chen

Publication date: 10 June 2005

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

zbMATH Keywords

Convex hullapproximate computingstrongly convex superhulltolerance in computational geometry

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• A sublogarithmic convex hull algorithm
• Parallel algorithms for some functions of two convex polygons
• Parallel computational geometry
• Optimal parallel algorithms for point-set and polygon problems
• Constructing strongly convex hulls using exact or rounded arithmetic
• Constructing strongly convex approximate hulls with inaccurate primitives

This page was built for publication: CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS