An intersection-sensitive algorithm for snap rounding
type: Item
instance of: scholarly article
title: An intersection-sensitive algorithm for snap rounding
zbMATH Open document ID: 1109.65018
author: Mark de Berg
author: Dan Halperin
author: Mark H. Overmars
published in: Computational Geometry
publication date: 2007-02-19T00:00:00Z
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 5128170
zbMATH Keywords: precision
zbMATH Keywords: robustness
zbMATH Keywords: geometric rounding
zbMATH Keywords: arrangements
zbMATH Keywords: algorithm
describes a project that uses: LEDA
MaRDI profile type: Publication
full work available at URL: j.comgeo.2006.03.002
OpenAlex ID: W2025131661
cites work: An optimal algorithm for intersecting line segments in the plane
cites work: Introduction to algorithms
cites work: Rounding Arrangements Dynamically
cites work: CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
cites work: Iterated snap rounding
cites work: Practical segment intersection with finite precision output
cites work: Q4702188
cites work: Verifiable implementations of geometric algorithms using finite precision arithmetic
cites work: Q3992847
cites work: Q4945515
cites work: On finite-precision representations of geometric objects
cites work: Towards exact geometric computation
DOI: 10.1016/J.COMGEO.2006.03.002
description: scientific article; zbMATH DE number 5128170