Sciweavers

71 search results - page 2 / 15
» Optimal Triangulation with Steiner Points
Sort
View
COMPGEOM
1991
ACM
13 years 8 months ago
Polynomial-Size Nonobtuse Triangulation of Polygons
We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle. Our main result is that a polygon with n sides can be triangulated with...
Marshall W. Bern, David Eppstein
INFORMATICALT
2000
96views more  INFORMATICALT 2000»
13 years 5 months ago
Investigation of Dead-Point Situations in the Simulation of Wet Film Evolution
The result of simulation of an idealized thin wet film connecting fixed points in the Euclidean plane is a length-minimizing curve. Gradually increasing the exterior pressure we ar...
Vydunas Saltenis
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
13 years 10 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
VLSID
2002
IEEE
109views VLSI» more  VLSID 2002»
14 years 5 months ago
Probabilistic Analysis of Rectilinear Steiner Trees
Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design. We present a probabilistic analysis method for constructing rectilinear Steiner t...
Chunhong Chen
EWC
2011
98views more  EWC 2011»
13 years 8 days ago
Real-time triangulation of point streams
Hand-held laser scanners are commonly used in industry for reverse engineering and quality measurements. In this process, it is difficult for the human operator to scan the target...
Klaus Denker, Burkhard Lehner, Georg Umlauf