Sciweavers

1949 search results - page 92 / 390
» Random graphs on surfaces
Sort
View
ENC
2004
IEEE
15 years 7 months ago
Graph-Based Point Relaxation for 3D Stippling
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
Oscar Meruvia Pastor, Thomas Strotthote
SMI
2003
IEEE
15 years 9 months ago
Using Growing Cell Structures for Surface Reconstruction
We study the use of neural network algorithms in surface reconstruction from an unorganized point cloud, and meshing of an implicit surface. We found that for such applications, t...
Ioannis P. Ivrissimtzis, Won-Ki Jeong, Hans-Peter ...
HICSS
1997
IEEE
107views Biometrics» more  HICSS 1997»
15 years 8 months ago
On Heuristic Mapping of Decision Surfaces for Post-Evaluation Analysis
The value for decision making of high-quality postsolution analysis of decision-supporting models can hardly be overestimated. Candle-lighting analysis (CLA) takes this notion ver...
Major Bill Branley, Russell Fradin, Steven O. Kimb...
STACS
2009
Springer
15 years 11 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
ECCV
2006
Springer
15 years 7 months ago
Quasi-conformal Flat Representation of Triangulated Surfaces for Computerized Tomography
In this paper we present a simple method for flattening of triangulated surfaces for mapping and imaging. The method is based on classical results of F. Gehring and Y. V
Eli Appleboim, Emil Saucan, Yehoshua Y. Zeevi