102291 search results - page 264 / 20459 » Computability in Computational Geometry |
183
click to vote
NPAR
2004
ACM
16 years 1 days ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
195
click to vote
ISMS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Surgical simulations with the aid of computers is a topic of increasingly extensive research. Realtime response and interactivity are crucial components of any such syste...
150
click to vote
JCDCG
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
164
click to vote
3DIM
2003
IEEE
15 years 12 months ago
2003
IEEE
We examine the problem of editing complex 3D objects. We convert the problem of editing a 3D object of arbitrary size and surface properties to a problem of editing a 2D image. We...
182
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...