Idioma:

The furthest-site geodesic Voronoi diagram

Boris. Aronov Steven Fortune; Gordon Wilfong; Courant Institute of Mathematical Sciences. Computer Science Department.

Localização: IQSC - Inst. Química de São Carlos (510 A67f )(Acessar)

Título:
The furthest-site geodesic Voronoi diagram
Autor: Boris. Aronov
Steven Fortune; Gordon Wilfong; Courant Institute of Mathematical Sciences. Computer Science Department.
Assuntos: Voronoi polygons; Algorithms; MATEMÁTICA
Notas: Includes bibliographical references (page 33).
Descrição: Abstract: "We present an O((n+k)log(n+k)) time, O(n+k) space algorithm for computing the furthest-site geodesic Voronoi diagram of k point sites within a simple n-sided polygon."
Títulos relacionados: Série:Technical report (Courant Institute of Mathematical Sciences. Computer Science Department) ; 420.; Robotics research technical report (Courant Institute of Mathematical Sciences. Computer Science Department) ; no. 186.
Editor: New York, N.Y. : New York University, Courant Institute of Mathematical Sciences, Computer Science Division
Data de criação/publicação: 1988
Formato: 33 pages : illustrations ; 28 cm..
Idioma: Inglês

Links

Voltar para lista de resultados