Sciweavers

665 search results - page 37 / 133
» Algorithms for Triangulated Terrains
Sort
View
CORR
2010
Springer
122views Education» more  CORR 2010»
14 years 9 months ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
DCG
2000
57views more  DCG 2000»
14 years 9 months ago
On the Generation of Oriented Matroids
We provide a multiple purpose algorithm for generating oriented matroids. An application disproves a conjecture of Gr
Jürgen Bokowski, A. Guedes de Oliveira
CGF
2000
155views more  CGF 2000»
14 years 9 months ago
Surface Reconstruction Based on Lower Dimensional Localized Delaunay Triangulation
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
M. Gopi, Shankar Krishnan, Cláudio T. Silva
AFRIGRAPH
2009
ACM
15 years 1 months ago
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and b...
Bernardt Duvenhage
FOCS
2004
IEEE
15 years 1 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler