Sciweavers

665 search results - page 106 / 133
» Algorithms for Triangulated Terrains
Sort
View
ICCAD
2005
IEEE
110views Hardware» more  ICCAD 2005»
15 years 6 months ago
Computational geometry based placement migration
Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To...
Tao Luo, Haoxing Ren, Charles J. Alpert, David Zhi...
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
15 years 4 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
COMPGEOM
2009
ACM
15 years 4 months ago
High resolution surface reconstruction from overlapping multiple-views
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
Nader Salman, Mariette Yvinec
CGI
2001
IEEE
15 years 1 months ago
Polygonizing Non-Uniformly Distributed 3D Points by Advancing Mesh Frontiers
30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive po...
Indriyati Atmosukarto, Luping Zhou, Wee Kheng Leow...
COMGEO
2006
ACM
14 years 9 months ago
On the sizes of Delaunay meshes
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
Siu-Wing Cheng