Sciweavers

254 search results - page 15 / 51
» Simplified Voronoi Diagrams
Sort
View
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 9 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
COMGEO
2004
ACM
13 years 7 months ago
The weighted farthest color Voronoi diagram on trees and graphs
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera ...
IJON
2010
119views more  IJON 2010»
13 years 5 months ago
V-Proportion: A method based on the Voronoi diagram to study spatial relations in neuronal mosaics of the retina
The visual system plays a predominant role in the human perception. Although all components of the eye are important to perceive visual information, the retina is a fundamental pa...
Óscar Martínez Mozos, Jose Angel Bol...
CDC
2010
IEEE
108views Control Systems» more  CDC 2010»
13 years 2 months ago
Optimal pursuit of moving targets using dynamic Voronoi diagrams
We consider Voronoi-like partitions for a team of moving targets distributed in the plane, such that each set in this partition is uniquely associated with a particular moving targ...
Efstathios Bakolas, Panagiotis Tsiotras
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 8 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount