Reprint of: Extreme point and halving edge search in abstract order types

DOI10.1016/J.COMGEO.2013.11.002zbMATH OpenNoneOpenAlexW2093282027MaRDI QIDQ390177FDOQ390177

Authors: Tillmann Miltzow, Alexander Pilz, Oswin Aichholzer 

Publication date: 22 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.11.002

Recommendations

• Extreme point and halving edge search in abstract order types
• Ham-sandwich cuts for abstract order types
• Ham-sandwich cuts for abstract order types
• The Complexity of Order Type Isomorphism
• The complexity of order type isomorphism

zbMATH Keywords

convex hull\(CC\) systemabstract order typechirotopehalving line

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines
• Time bounds for selection
• Multidimensional Sorting
• Axioms and hulls
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Semispaces of configurations, cell complexes of arrangements
• A theorem of ordered duality
• Algorithms for ham-sandwich cuts
• Geodesic order types
• The Ultimate Planar Convex Hull Algorithm?
• Abstract order type extension and new results on the rectilinear crossing number

Cited In (1)

• Grassmannians and pseudosphere arrangements

This page was built for publication: Reprint of: Extreme point and halving edge search in abstract order types

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