21 search results - page 3 / 5 » Voronoi diagram computations for planar NURBS curves |
GRAPHICSINTERFACE
2007
14 years 11 months ago
2007
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
GMP
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...
100
click to vote
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...