Taking a Walk in a Planar Arrangement

DOI10.1137/S0097539799362627zbMath0976.68157MaRDI QIDQ2706112

Sariel Har-Peled

Publication date: 19 March 2001

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

levelscomputational geometryplanar arrangementssingle face

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (8)

Median trajectories ⋮ PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS ⋮ A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams ⋮ A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams ⋮ Minimizing the error of linear separators on linearly inseparable data ⋮ Sorting weighted distances with applications to objective function evaluations in single facility location problems. ⋮ Approximating the maximum overlap of polygons under translation ⋮ AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE

This page was built for publication: Taking a Walk in a Planar Arrangement