k-Sets of Convex Inclusion Chains of Planar Point Sets

DOI10.1007/11821069_30MaRDI QIDQ5756674zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Centroid triangulations from \(k\)-sets
• Divide and Conquer Method for k-Set Polygons
• On \(k\)-convex point sets
• Counting k-subsets and convex k-gons in the plane
• A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS

Cited in

(4)

• On \(k\)-convex point sets
• Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
• Centroid triangulations from \(k\)-sets
• Divide and Conquer Method for k-Set Polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756674)