Optimization in arrangements

DOI10.1007/3-540-36494-3_6MaRDI QIDQ4418636zbMATH OpenFDO

Authors Stefan Langerman, William Steiger

Publication date 11 August 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070050.htm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS
• A note on searching line arrangements and applications
• A special class of problems of geometric optimization
• Optimal algorithms for geometric centers and depth
• scientific article; zbMATH DE number 4131656

Cited in

(21)

• Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
• The discrete Voronoi game in \(\mathbb{R}^2\)
• On Liu's simplicial depth and Randles' interdirections
• A center transversal theorem for hyperplanes and applications to graph drawing
• Optimization of Cartesian tasks with configuration selection
• Bisecting three classes of lines
• Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
• A proof of the Oja depth conjecture in the plane
• Algorithms for bivariate zonoid depth
• scientific article; zbMATH DE number 4139504 (Why is no real title available?)
• A special class of problems of geometric optimization
• On Combinatorial Depth Measures
• On the number of radial orderings of colored planar point sets
• A survey of mass partitions
• Extending the centerpoint theorem to multiple points
• Optimization problems on general classes of rearrangements
• An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
• Optimal algorithms for geometric centers and depth
• Partitioning axis-parallel lines in 3D
• Order Reconfiguration Under Width Constraints.
• Combinatorial configurations in balance layout optimization problems

This page was built for publication: Optimization in arrangements

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