Topologically Sweeping Visibility Complexes via Pseudotriangulations

Topologically Sweeping Visibility Complexes via Pseudotriangulations (1996)

Cached

Download Links

[link.springer-ny.com]

Other Repositories/Bibliography

DBLP

by M. Pocchiola , G. Vegter

Citations:

78 - 8 self

Versions

Version History

Metadata Version 4

User correction supplied by mph

Datum	Value	Source
TITLE	Topologically Sweeping Visibility Complexes via Pseudotriangulations	user correction - Legacy Corrections
AUTHOR NAME	M. Pocchiola	user correction
AUTHOR AFFIL	Département de Mathématiques et Informatique, Ecole normale supérieure,	user correction
AUTHOR ADDR	ura 1327 du CNRS, 45 rue d’Ulm, 75230 Paris Cedex 05, France	user correction
AUTHOR NAME	G. Vegter	user correction
AUTHOR AFFIL	Department of Mathematics and Computer Science, University of Groningen,	user correction
AUTHOR ADDR	P.O. Box 800, 9700 AV Groningen, The Netherlands	user correction
ABSTRACT	This paper describes a new algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(n log n + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal running time, this is the first optimal algorithm that uses only linear space. The visibility graph or the visibility complex can be computed in the same time and space. The only complicated data structure used by the algorithm is a splittable queue, which can be implemented easily using red--black trees. The algorithm is conceptually very simple, and should therefore be easy to implement and quite fast in practice. The algorithm relies on greedy pseudotriangulations, which are subgraphs of the visibility graph with many nice combinatorial properties. These properties, and thus the correctness of the algorithm, are partially derived from properties of a certain partial order on the faces of th...	user correction
YEAR	1996	user correction - Legacy Corrections
CITATIONS	30 found	ParsCit 1.0