995 search results - page 88 / 199 » Constructive Volume Geometry |
175
click to vote
IMR
2003
Springer
15 years 11 months ago
2003
Springer
Topology modification of hexahedral meshes has been considered difficult due to the propagation of topological modifications non-locally. We address this problem by working in the...
183
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
139
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy eval...
222
click to vote
GM
1999
Springer
15 years 10 months ago
1999
Springer
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...
169
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...