Sciweavers

188 search results - page 34 / 38
» Pointed Drawings of Planar Graphs
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Size Competitive Meshing Without Large Angles
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
Gary L. Miller, Todd Phillips, Donald Sheehy
ISAAC
2001
Springer
123views Algorithms» more  ISAAC 2001»
13 years 11 months ago
Labeling Subway Lines
Abstract. Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a pr...
Maria Angeles Garrido, Claudia Iturriaga, Alberto ...
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
14 years 25 days 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 ...
ICCV
2001
IEEE
14 years 9 months ago
Reconstructing Surfaces Using Anisotropic Basis Functions
Point sets obtained from computer vision techniques are often noisy and non-uniform. We present a new method of surface reconstruction that can handle such data sets using anisotr...
Huong Quynh Dinh, Greg Turk, Gregory G. Slabaugh
COMGEO
2010
ACM
13 years 7 months ago
The complexity of flow on fat terrains and its i/o-efficient computation
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
Mark de Berg, Otfried Cheong, Herman J. Haverkort,...