Sciweavers

2342 search results - page 237 / 469
» Sublinear geometric algorithms
Sort
View
113
Voted
COMPGEOM
2003
ACM
15 years 8 months ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote
ICRA
2002
IEEE
132views Robotics» more  ICRA 2002»
15 years 8 months ago
Visually Built Task Models for Robot Teams in Unstructured Environments
In field environments it is not usually possible to provide robotic systems with valid geometric models of the task and environment. The robot or robot teams will need to create t...
Vivek A. Sujan, Steven Dubowsky
126
Voted
COMPGEOM
2009
ACM
15 years 8 months ago
Visibility maps of realistic terrains have linear smoothed complexity
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
Mark de Berg, Herman J. Haverkort, Constantinos P....
96
Voted
ESA
2001
Springer
61views Algorithms» more  ESA 2001»
15 years 8 months ago
A Separation Bound for Real Algebraic Expressions
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for int...
Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, S...
126
Voted
CAV
1998
Springer
98views Hardware» more  CAV 1998»
15 years 7 months ago
Verification of Timed Systems Using POSETs
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
Wendy Belluomini, Chris J. Myers