Name
Abstract | ||
|---|---|---|
An algorithm Sweepplane is presented to be used as an auxiliary algorithm by space-sweep algorithms requiring a sweep plane in regular position, i.e., a sweep plane which never meets 2 event points at the same time. Sweepplane is an on-line algorithm which ensures that the regular position of the sweep plane is never destroyed by a new event point created during the sweep. If necessary, it dynamically replaces the actual sweep plane by a more suitable one, but always in such a way that the induced order of the event points already swept is maintained. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/3-540-54891-2_3 | Workshop on Computational Geometry |
Keywords | Field | DocType |
regular position,constructing sweep planes,on-line algorithm | Ramer–Douglas–Peucker algorithm,Computer science,Computational geometry,Algorithm,Lexicographical order,Sweep line algorithm | Conference |
Volume | ISSN | ISBN |
553 | 0302-9743 | 3-540-54891-2 |
Citations | PageRank | References |
1 | 0.41 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hanspeter Bieri | 1 | 81 | 22.13 |
| Peter-Michael Schmidt | 2 | 3 | 1.66 |