A decompositin theorem for convexity spaces

DOI10.1007/BF01231029zbMath0685.52001MaRDI QIDQ1826114

Derick Wood, Gregory J. E. Rawlins

Publication date: 1989

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

zbMATH Keywords

alignmentpolygoncomputational geometryorthogonal convexityconvexity spacelink convexity

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Axiomatic and generalized convexity (52A01) Convex sets in (2) dimensions (including convex curves) (52A10) Convex sets in topological linear spaces; Choquet theory (46A55)

Related Items (3)

Fundamentals of restricted-orientation convexity ⋮ Visibility in semi-convex spaces ⋮ Partial convexity

Cites Work

• On the definition and computation of rectilinear convex hulls
• On some union and intersection problems for polygons with fixed orientations
• Optimal computation of finitely oriented convex hulls
• Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
• Optimal algorithms to compute the closure of a set of iso-rectangles
• A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
• On L n Sets, the Hausdorff Metric, and Connectedness
• Local Convexity and L n Sets
• What is a Convex Set?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A decompositin theorem for convexity spaces