We give efficient algorithms for computing a minimum-perimeter k-gon that encloses a given n-gon. Key words: Computational Geometry, Polygon Optimization
Previous parametric representations of smooth genus-zero surfaces require a collection of abutting patches (e.g. splines, NURBS, recursively subdivided polygons). We introduce a s...
Frank Losasso, Hugues Hoppe, Scott Schaefer, Joe D...
We introduce a new geometry manipulator, a tool for 2D geometrical object manipulations in drawing packages. The manipulator is an extended combination of two standard approaches....
Sviataslau Pranovich, Jarke J. van Wijk, Kees van ...
Abstract. We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms f...
In this paper, we propose a new technique for hardware accelerated multi-resolution geometry synthesis. The level of detail for a given viewpoint is created on-the-fly, allowing f...