COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
Within industrial contexts, a common view of the level of confidence needed in CAD data transfer processes may be expressed as “1 don’t mind if the [CAD data- tmnsfer] algorit...
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P1, P2, P3, . . . , Pk in a container polygon Q, translate an...
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
We report an empirical comparision of different heuristic techniques for variable-sized pointfeature label placement. This work may not be copied or reproduced in whole or in part...
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
Motivated by applications of foveated images in visualization, we introduce the foveation transform of an image. We study the basic properties of these transforms using the multir...
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...