10.1137/0215019
Herbert Edelsbrunner
Herbert
Edelsbrunner0000-0002-9823-6833
Welzl, Emo
Emo
Welzl
Constructing belts in two-dimensional arrangements with applications
SIAM
1986
2018-12-11T12:07:00Z
2019-05-10T12:19:52Z
journal_article
https://research-explorer.app.ist.ac.at/record/4110
https://research-explorer.app.ist.ac.at/record/4110.json
For $H$ a set of lines in the Euclidean plane, $A(H)$ denotes the induced dissection, called the arrangement of $H$. We define the notion of a belt in $A(H)$, which is bounded by a subset of the edges in $A(H)$, and describe two algorithms for constructing belts. All this is motivated by applications to a host of seemingly unrelated problems including a type of range search and finding the minimum area triangle with the vertices taken from some finite set of points.
© 1986 © Society for Industrial and Applied Mathematics