Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISVD.2006.9 | Banff, Alberta, BC |
Keywords | Field | DocType |
angular voronoi diagram,smallest visual angle,visual angle,voronoi region,line segment,point set,ordinary voronoi diagram,interesting property,efficient algorithm,voronoi diagram,set theory,upper bound,computer science,finite element methods,computational geometry,mesh generation,information science,application software | Line segment,Power diagram,Topology,Visual angle,Combinatorics,Centroidal Voronoi tessellation,Mathematical diagram,Voronoi diagram,Fortune's algorithm,Weighted Voronoi diagram,Mathematics | Conference |
ISBN | Citations | PageRank |
0-7695-2630-6 | 9 | 1.00 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tetsuo Asano | 1 | 1448 | 229.35 |
| Hisao Tamaki | 2 | 1098 | 105.17 |
| naoki katoh | 3 | 1101 | 187.43 |
| Takeshi Tokuyama | 4 | 1179 | 417.31 |