[PDF][PDF] Routing with guaranteed delivery in ad hoc wireless networks
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which
nodes are points in the plane and two nodes can communicate if the distance between them …
nodes are points in the plane and two nodes can communicate if the distance between them …
Digital elevation models and TIN algorithms
M Van Kreveld - Advanced School on the Algorithmic Foundations of …, 1996 - Springer
This survey has explained a number of concepts on terrains, and some algorithms for
various computations. The emphasis has been on TIN algorithms, because the TIN model …
various computations. The emphasis has been on TIN algorithms, because the TIN model …
[PDF][PDF] Triangulations in CGAL
Triangulations in CGAL* Page 1 Triangulations in CGAL* [Extended Abstract] Jean Daniel
Boissonnat Olivier Devillers Monique Teillaud INRIA BP93 06902 Sophia Antipolis, France …
Boissonnat Olivier Devillers Monique Teillaud INRIA BP93 06902 Sophia Antipolis, France …
Walking in a triangulation
Walking in a triangulation Page 1 Walking in a triangulation Olivier Devillers Sylvain Pion
Monique Teillaud ABSTRACT Given a triangulation in the plane or a tetrahedralization in 3-space …
Monique Teillaud ABSTRACT Given a triangulation in the plane or a tetrahedralization in 3-space …
Online routing in triangulations
We consider online routing strategies for routing between the vertices of embedded planar
straight line graphs. Our results include (1) two deterministic memoryless routing strategies …
straight line graphs. Our results include (1) two deterministic memoryless routing strategies …
Online routing in triangulations
We consider online routing algorithms for routing between the vertices of embedded planar
straight line graphs. Our results include (1) two deterministic memoryless routing algorithms …
straight line graphs. Our results include (1) two deterministic memoryless routing algorithms …
Applications of computational geometry to geographic information systems.
L De Floriani, P Magillo, E Puppo - Handbook of computational …, 2000 - books.google.com
During the last decade, Geographical Information Systems (GISs) have gained a great
impact over a variety of important application fields [171]. According to Goodchild, Kemp …
impact over a variety of important application fields [171]. According to Goodchild, Kemp …
Kinetic binary space partitions for intersecting segments and disjoint triangles
We describe randomized algorithms for efficiently maintaining a binary space partition of
continuously moving, possibly intersecting, line segments in the plane, and of continuously …
continuously moving, possibly intersecting, line segments in the plane, and of continuously …
RNG and internal node based broadcasting algorithms for wireless one-to-one networks
M Seddigh, JS Gonzalez, I Stojmenovic - ACM SIGMOBILE Mobile …, 2001 - dl.acm.org
In a multihop wireless network, each node has a transmission radius and is able to send a
message to one of its neighbors (one-to-one) or all of its neighbors (one-to-all) that are …
message to one of its neighbors (one-to-one) or all of its neighbors (one-to-all) that are …
A one-step crust and skeleton extraction algorithm
C Gold, J Snoeyink - Algorithmica, 2001 - Springer
We wish to extract the topology from scanned maps. In previous work [GNY] this was done
by extracting a skeleton from the Voronoi diagram, but this required vertex labelling and was …
by extracting a skeleton from the Voronoi diagram, but this required vertex labelling and was …