Sciweavers

665 search results - page 44 / 133
» Algorithms for Triangulated Terrains
Sort
View
ECCV
2006
Springer
15 years 1 months ago
Quasi-conformal Flat Representation of Triangulated Surfaces for Computerized Tomography
In this paper we present a simple method for flattening of triangulated surfaces for mapping and imaging. The method is based on classical results of F. Gehring and Y. V
Eli Appleboim, Emil Saucan, Yehoshua Y. Zeevi
COMPGEOM
2004
ACM
15 years 3 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
CVPR
2011
IEEE
14 years 5 months ago
Distributed Computer Vision Algorithms Through Distributed Averaging
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
Roberto Tron, René, Vidal
CGVR
2006
14 years 11 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger
IROS
2008
IEEE
172views Robotics» more  IROS 2008»
15 years 4 months ago
HybridExploration: A distributed approach to terrain exploration using mobile and fixed sensor nodes
— When an emergency occurs within a building, it may be initially safer to send autonomous mobile nodes, instead of human responders, to explore the area and identify hazards and...
Ettore Ferranti, Niki Trigoni, Mark Levene