Sciweavers

3005 search results - page 257 / 601
» Computational geometry for sculpture
Sort
View
ALGORITHMICA
2010
72views more  ALGORITHMICA 2010»
15 years 7 months ago
Largest and Smallest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Maarten Löffler, Marc J. van Kreveld
AMC
2007
108views more  AMC 2007»
15 years 7 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
CGF
2007
145views more  CGF 2007»
15 years 6 months ago
Data-driven Tetrahedral Mesh Subdivision
Given a tetrahedral mesh immersed in a voxel model, we present a method to refine the mesh to reduce the discrepancy between interpolated values based on either scheme at arbitra...
L. Rodriguez, Isabel Navazo, Alvar Vinacua
IPL
2006
109views more  IPL 2006»
15 years 6 months ago
The number of guillotine partitions in d dimensions
Guillotine partitions play an important role in many research areas and application domains, e.g., computational geometry, computer graphics, integrated circuit layout, and solid ...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan R...
CAD
2000
Springer
15 years 6 months ago
Error propagation in geometric constructions
In this paper we consider error propagation in geometric constructions from a geometric viewpoint. First we study affine combinations of convex bodies: This has numerous examples ...
Johannes Wallner, Rimvydas Krasauskas, Helmut Pott...