Sciweavers

102291 search results - page 361 / 20459
» Computability in Computational Geometry
Sort
View
ALGORITHMICA
2007
165views more  ALGORITHMICA 2007»
15 years 7 months ago
Motorcycle Graphs and Straight Skeletons
We present a new algorithm to compute motorcycle graphs. It runs in O(n √ n log n) time when n is the number of motorcycles. We give a new characterization of the straight skele...
Siu-Wing Cheng, Antoine Vigneron
SIGGRAPH
1994
ACM
15 years 11 months ago
The irradiance Jacobian for partially occluded polyhedral sources
The irradiance at a point on a surface due to a polyhedral source of uniform brightness is given by a well-known analytic formula. In this paper we derive the corresponding analyt...
James Arvo
172
Voted
COMPGEOM
2006
ACM
16 years 23 days ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
SIGGRAPH
2010
ACM
15 years 11 months ago
A connection between partial symmetry and inverse procedural modeling
In this paper, we address the problem of inverse procedural modeling: Given a piece of exemplar 3D geometry, we would like to find a set of rules that describe objects that are s...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel
SI3D
1999
ACM
15 years 11 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
« Prev « First page 361 / 20459 Last » Next »