Sciweavers

73 search results - page 5 / 15
» Time Convex Hull with a Highway
Sort
View
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
13 years 9 months ago
Robust Kinetic Convex Hulls in 3D
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 7 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu
IWCIA
2009
Springer
13 years 12 months ago
What Does Digital Straightness Tell about Digital Convexity?
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
Tristan Roussillon, Laure Tougne, Isabelle Sivigno...
CCCG
2006
13 years 8 months ago
Removing Outliers to Minimize Area and Perimeter
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c +...
Rossen Atanassov, Pat Morin, Stefanie Wuhrer