Recent progress in exact geometric computation
type: Item
instance of: scholarly article
title: Recent progress in exact geometric computation
zbMATH Open document ID: 1080.68106
author: Chen Li
author: Sylvain Pion
author: Chee K. Yap
published in: The Journal of Logic and Algebraic Programming
publication date: 2005-06-01T00:00:00Z
full work available at URL: p.pdf
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 2173293
zbMATH Keywords: Exact geometric computation
zbMATH Keywords: Constructive zero bounds
zbMATH Keywords: Non-robustness problems
zbMATH Keywords: Robust algorithms
zbMATH Keywords: Approximate expression evaluation
zbMATH Keywords: Precision-driven computation
zbMATH Keywords: Numerical filters
zbMATH Keywords: Interval arithmetic
zbMATH Keywords: C++ libraries
describes a project that uses: CGAL
describes a project that uses: Pascal-SC
MaRDI profile type: Publication
OpenAlex ID: W1986405515
cites work: Q3345690
cites work: Pseudo approximation algorithms, with applications to optimal motion planning
cites work: Q4411357
cites work: Q4252031
cites work: Q4372496
cites work: Designing programs that check their work
cites work: Self-testing/correcting with applications to numerical problems
cites work: Interval arithmetic yields efficient dynamic filters for computational geometry
cites work: A strong and easily computable separation bound for arithmetic expressions involving radicals
cites work: Q4796179
cites work: EXACT GEOMETRIC COMPUTATION USING CASCADING
cites work: Constructing roadmaps of semi-algebraic sets. I: Completeness
cites work: Q4225319
cites work: Q3829044
cites work: Q4344150
cites work: A probabilistic analysis of the power of arithmetic filters
cites work: Hypergeometric Functions in Exact Geometric Computation
cites work: Q3772828
cites work: Towards and open curved kernel
cites work: Special issue: Implementation of geometric algorithms
cites work: Structural filtering: a paradigm for efficient and exact geometric programs
cites work: Q4348479
cites work: Q4531979
cites work: Rounding Arrangements Dynamically
cites work: Practical segment intersection with finite precision output
cites work: Q4471314
cites work: Simplification of Nested Radicals
cites work: A new constructive root bound for algebraic expressions. (Extended abstract)
cites work: Q5797046
cites work: Checking geometric programs or verification of geometric structures
cites work: Q4248251
cites work: Verifiable implementations of geometric algorithms using finite precision arithmetic
cites work: Q5566070
cites work: Automatic generation of staged geometric predicates
cites work: Computational Geometry in C
cites work: Q3809109
cites work: Certification of numerical computation of the sign of the determinant of a matrix
cites work: Constructive root bound for k -ary rational input numbers
cites work: Q3992847
cites work: How to recognize zero?
cites work: When Close Enough is Close Enough
cites work: Q4945515
cites work: An axiomatic approach to robust geometric programs
cites work: Precision-Sensitive Euclidean Shortest Path in 3-Space
cites work: Q4008399
cites work: Two design principles of geometric algorithms in finite-precision arithmetic
cites work: Topology-oriented implementation -- an approach to robust geometric algorithms
cites work: Q4530835
cites work: Q4485693
cites work: Towards exact geometric computation
cites work: Q4953977
cites work: Q5718722
DOI: 10.1016/J.JLAP.2004.07.006
description: scientific article; zbMATH DE number 2173293