36 search results - page 7 / 8 » Topology and arrangement computation of semi-algebraic plana... |
170
click to vote
SMA
2005
ACM
16 years 8 days ago
2005
ACM
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...
187
click to vote
GMP
2006
IEEE
16 years 23 days 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...
160
Voted
DIAGRAMS
2006
Springer
15 years 10 months ago
2006
Springer
The intuitive properties of configurations of planar non-overlapping closed curves (boundaries) are presented as a pure boundary mathematics. The mathematics, which is not incorpor...
180
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
183
click to vote
SMA
2006
ACM
16 years 19 days ago
2006
ACM
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...