Sciweavers

665 search results - page 90 / 133
» Algorithms for Triangulated Terrains
Sort
View
WADS
2007
Springer
106views Algorithms» more  WADS 2007»
15 years 4 months ago
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
COMPGEOM
2003
ACM
15 years 3 months ago
Loops in reeb graphs of 2-manifolds
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
Kree Cole-McLaughlin, Herbert Edelsbrunner, John H...
SI3D
2003
ACM
15 years 3 months ago
Budget sampling of parametric surface patches
We investigate choosing point samples on a model comprising parametric patches to meet a user specified budget. These samples may then be triangulated, rendered as points or ray-...
Jatin Chhugani, Subodh Kumar
VISUALIZATION
2000
IEEE
15 years 2 months ago
Constructing material interfaces from data sets with volume-fraction information
We present a new algorithm for material boundary interface reconstruction from data sets containing volume fractions. We transform the reconstruction problem to a problem that ana...
Kathleen S. Bonnell, Kenneth I. Joy, Bernd Hamann,...
COMPGEOM
1996
ACM
15 years 2 months ago
Robust Adaptive Floating-Point Geometric Predicates
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
Jonathan Richard Shewchuk