Sciweavers

215 search results - page 23 / 43
» Farthest-Polygon Voronoi Diagrams
Sort
View
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
13 years 7 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu
ACRI
2006
Springer
14 years 1 months ago
Modeling Robot Path Planning with CD++
Robotic systems are usually built as independent agents that collaborate to accomplish a specific task. Analysis of robot path planning consists of route planning and path generati...
Gabriel A. Wainer
MICS
2010
128views more  MICS 2010»
13 years 2 months ago
Arrangements on Parametric Surfaces II: Concretizations and Applications
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...
Eric Berberich, Efi Fogel, Dan Halperin, Michael K...
CCCG
2009
13 years 8 months ago
Defining and computing accessibility radius
In structural molecular biology software, the accessibility of an atom in a molecule to a ball representing solvent is either computed slowly by building a solventaccessible surfa...
Vishal Verma, Jack Snoeyink
AAI
2006
86views more  AAI 2006»
13 years 7 months ago
Geometric Task Decomposition in a Multi-Agent Environment
Task decomposition in a multi-agent environment is often performed online. This paper proposes a method for subtask allocation that can be performed before the agents are deployed...
Kaivan Kamali, Dan Ventura, Amulya Garga, Soundar ...