C. Burnikel
K. Mehlhorn
ABSTRACT
No abstract available.
- 1.M.O. Benouamer, P. Jaillon, D. Michelucci, and J.- M. Moreau. A "lazy" solution to imprecision in computational geometry. 5th CCCG, pp. 73-78, 1993.Google Scholar
- 2.C. Burnikel, K. Mehlhorn, and S. Schirra. How to compute the Voronoi diagram of line segments' Theoretical and experimental results. ESA'94, pp. 9,2'?-239, 1994. Google ScholarDigital Library
- 3.S. Fortune and C. van Wyk. Efficient exact arithmetic for computational geometry. Proc. of the 9th Syrup. on Computational Geometry, pages 163-171, 1993. Google ScholarDigital Library
- 4.K. Mehlhorn and S. NKher. LEDA: A platform for combinatorial and geometric computing. CACM, Jan. 1995. Google ScholarDigital Library
- 5.M. Mignotte. Mathematics /or Computer Algebra. Springer Verlag, 1992. Google ScholarDigital Library
- 6.C.K. Yap and T. Dube. The exact computation paradigm. In Computing in Euclidean Geometry II, 1995.Google ScholarCross Ref
Index Terms
- Exact geometric computation in LEDA
Recommendations
Isotropic remeshing with fast and exact computation of Restricted Voronoi Diagram
SGP '09: Proceedings of the Symposium on Geometry ProcessingWe propose a new isotropic remeshing method, based on Centroidal Voronoi Tessellation (CVT). Constructing CVT requires to repeatedly compute Restricted Voronoi Diagram (RVD), defined as the intersection between a 3D Voronoi diagram and an input mesh ...
Exact numerical computation in algebra and geometry
ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computationMany problems in Computational Science & Engineering (CSE) are defined on the continuum. Standard algorithms for these problems are numerical and approximate. Their computational techniques include iteration, subdivision, and approximation. Such ...
On Multiplicative $\lambda$-Approximations and Some Geometric Applications
† Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010)Let $\mathcal{F}$ be a set system over an underlying finite set $X$, and let $\mu$ be a nonnegative measure over $X$; i.e., for every $S \subseteq X$, $\mu(S)=\sum_{x\in S} \mu(x)$. A measure $\mu^*$ on $X$ is called a multiplicative ${\lambda}$-...
Comments