Sciweavers

100 search results - page 3 / 20
» A simple entropy-based algorithm for planar point location
Sort
View
GMP
2003
IEEE
15 years 6 months ago
Extensible Point Location Algorithm
We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked li...
Rashmi Sundareswara, Paul R. Schrater
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 24 days ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
15 years 26 days 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
ICNP
2005
IEEE
15 years 6 months ago
Simple Robotic Routing in Ad Hoc Networks
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
Daejoong Kim, Nicholas F. Maxemchuk
ISVC
2010
Springer
14 years 11 months ago
Interpolating 3D Diffusion Tensors in 2D Planar Domain by Locating Degenerate Lines
Interpolating diffusion tensor fields is a key technique to visualize the continuous behaviors of biological tissues such as nerves and muscle fibers. However, this has been stil...
Chongke Bi, Shigeo Takahashi, Issei Fujishiro