36 search results - page 6 / 8 » Topology and arrangement computation of semi-algebraic plana... |
PG
2007
IEEE
14 years 1 months ago
2007
IEEE
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
An algorithm is presented for the geometric analysis of an algebraic curve f(x, y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the pla...
GRAPHICSINTERFACE
2007
13 years 9 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...
GD
2004
Springer
14 years 27 days ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
This paper presents a sparse representation of 2D planar shape through the composition of warping functions, termed formlets, localized in scale and space. Each formlet subjects t...