TY - GEN

T1 - Angular Voronoi diagram with applications

AU - Asano, Tetsuo

AU - Tamaki, Hisao

AU - Katoh, Naoki

AU - Tokuyama, Takeshi

PY - 2006

Y1 - 2006

N2 - Given a set of line segments in the plane, we define an angular Voronoi diagram as follows: a point belongs to a Voronoi region of a line segment if the visual angle of the line segment from the point is smallest among all line segments. The Voronoi diagram is interesting in itself and different from an ordinary Voronoi diagram for a point set. After introducing interesting properties, we present an efficient algorithms for finding a point to maximize the smallest visual angle. Some applications to mesh improvement are also mentioned.

AB - Given a set of line segments in the plane, we define an angular Voronoi diagram as follows: a point belongs to a Voronoi region of a line segment if the visual angle of the line segment from the point is smallest among all line segments. The Voronoi diagram is interesting in itself and different from an ordinary Voronoi diagram for a point set. After introducing interesting properties, we present an efficient algorithms for finding a point to maximize the smallest visual angle. Some applications to mesh improvement are also mentioned.

UR - http://www.scopus.com/inward/record.url?scp=34250338197&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250338197&partnerID=8YFLogxK

U2 - 10.1109/ISVD.2006.9

DO - 10.1109/ISVD.2006.9

M3 - Conference contribution

AN - SCOPUS:34250338197

SN - 0769526306

SN - 9780769526300

T3 - Proceedings - 3rd International Symposium on Voronoi Diagrams in Science and Engineering 2006, ISVD 2006

SP - 18

EP - 24

BT - Proceedings - 3rd International Symposium on Voronoi Diagrams in Science and Engineering 2006, ISVD 2006

T2 - 3rd International Symposium on Voronoi Diagrams in Science and Engineering 2006, ISVD 2006

Y2 - 2 July 2006 through 5 July 2006

ER -