Sciweavers

665 search results - page 33 / 133
» Algorithms for Triangulated Terrains
Sort
View
SODA
2012
ACM
185views Algorithms» more  SODA 2012»
13 years 5 days ago
On a linear program for minimum-weight triangulation
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
Arman Yousefi, Neal E. Young
CORR
2002
Springer
98views Education» more  CORR 2002»
14 years 9 months ago
Compact Floor-Planning via Orderly Spanning Trees
Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floor-plan for a...
Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
ACMSE
2005
ACM
15 years 3 months ago
Interactive 3D terrain exploration and visualization
The CECA VisLab is currently investigating the educational uses of a GeoWall 3D Stereo Rendering system. Many commercial and non-commercial programs are currently available for ge...
Stephanie A. Smullen, Clinton W. Smullen III, Carl...
SIROCCO
2010
14 years 11 months ago
Asynchronous Deterministic Rendezvous in Bounded Terrains
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, ...
PAMI
2011
14 years 17 days ago
Construction of Iso-Contours, Bisectors, and Voronoi Diagrams on Triangulated Surfaces
—In the research of computer vision and machine perception, three-dimensional objects are usually represented by 2-manifold triangular meshes M. In this paper, we present practic...
Yong-Jin Liu, Zhanqing Chen, Kai Tang