k-Sets of Convex Inclusion Chains of Planar Point Sets

DOI10.1007/11821069_30zbMath1132.68792OpenAlexW1501672630MaRDI QIDQ5756674

Wael El Oraiby, Dominique Schmitt

Publication date: 5 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11821069_30

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Divide and Conquer Method for k-Set Polygons

This page was built for publication: k-Sets of Convex Inclusion Chains of Planar Point Sets