19 search results - page 3 / 4 » I O-efficient algorithms for computing planar geometric span... |
SIGGRAPH
1995
ACM
13 years 9 months ago
1995
ACM
Image-based rendering is a powerful new approach for generating real-time photorealistic computer graphics. It can provide convincing animations without an explicit geometric repr...
SGP
2007
13 years 8 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
FLAIRS
1998
13 years 7 months ago
1998
Computer assisted tomography (CAT) systems demandlarge amounts of time and space. In this paper, wedescribe an approachto solving the CAT problemusing several AItechniques includi...
TOG
2008
13 years 6 months ago
2008
Motivated by applications in architecture and manufacturing, we discuss the problem of covering a freeform surface by single curved panels. This leads to the new concept of semi-d...
SMA
2006
ACM
14 years 6 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...