| Presentation | 1997/1/24 Level walk on arrangement in the plane Atsushi Doi, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper, we present a new sweeping algorithm, called "level walk", for a given arangement of n lines in the plane. Level walk efficiently traverses all edges and vertices of the arrangement that exist in a given polygonal region. By using this property, we can apply this algorithm to Sloving optimal cell problem. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Computational Geometry / Arrangement / Level walk / Optimal cell problem / Dual transformation |
| Paper # | COMP96-78 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1997/1/24(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Level walk on arrangement in the plane |
| Sub Title (in English) | |
| Keyword(1) | Computational Geometry |
| Keyword(2) | Arrangement |
| Keyword(3) | Level walk |
| Keyword(4) | Optimal cell problem |
| Keyword(5) | Dual transformation |
| 1st Author's Name | Atsushi Doi |
| 1st Author's Affiliation | University of Electro-Communication() |
| Date | 1997/1/24 |
| Paper # | COMP96-78 |
| Volume (vol) | vol.96 |
| Number (no) | 488 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |