Sciweavers

346 search results - page 30 / 70
» Isodiametric Problems for Polygons
Sort
View
COMPGEOM
2006
ACM
14 years 3 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
JMMA
2002
71views more  JMMA 2002»
13 years 9 months ago
Optimal Hierarchies for Quadrilateral Surfaces
Abstract. Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two r...
Kuo-Liang Chung, Wen-Ming Yan, Jung-Gen Wu
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
14 years 3 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
CG
1999
Springer
13 years 9 months ago
A visibility algorithm for hybrid geometry- and image-based modeling and rendering
Hybrid geometry- and image-based modeling and rendering systems use photographs taken of a real-world environment and mapped onto the surfaces of a 3D model to achieve photorealis...
Thomas A. Funkhouser
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
13 years 8 months ago
Maintaining connectivity in environments with obstacles
Abstract— Robotic routers (mobile robots with wireless communication capabilities) can create an adaptive wireless network and provide communication services for mobile users ond...
Onur Tekdas, Patrick A. Plonski, Nikhil Karnad, Vo...