Sciweavers

1879 search results - page 367 / 376
» Computational geometry algorithms library
Sort
View
125
Voted
SPAA
2004
ACM
15 years 6 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
COMPGEOM
2003
ACM
15 years 6 months ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...
104
Voted
ICMI
2003
Springer
116views Biometrics» more  ICMI 2003»
15 years 6 months ago
Interactive skills using active gaze tracking
We have incorporated interactive skills into an active gaze tracking system. Our active gaze tracking system can identify an object in a cluttered scene that a person is looking a...
Rowel Atienza, Alexander Zelinsky
ECCV
1998
Springer
15 years 5 months ago
Stereo Vision-Based Navigation in Unknown Indoor Environment
Different applications in the field of vision-based navigation of autonomous mobile robots depend on the degree of knowledge of the environment. Indoor environment applications oft...
Oliver Schreer