On finite-precision representations of geometric objects

DOI10.1016/0022-0000(89)90046-9zbMath0693.10026OpenAlexW2018687717MaRDI QIDQ584309

Kōkichi Sugihara

Publication date: 1989

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(89)90046-9

zbMATH Keywords

algorithmscontinued fraction expansionapproximation of hyperplanesbasis reduction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

An intersection-sensitive algorithm for snap rounding ⋮ A natural lattice basis problem with applications ⋮ RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS ⋮ A perturbation scheme for spherical arrangements with application to molecular modeling

Cites Work

• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• A theory of computer rational numbers
• How to Calculate Shortest Vectors in a Lattice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On finite-precision representations of geometric objects