Iterated snap rounding
type: Item
instance of: scholarly article
title: Iterated snap rounding
zbMATH Open document ID: 1011.68145
DOI: 10.1016/S0925-7721(01)00064-5
author: Dan Halperin
author: Eli Packer
published in: Computational Geometry
publication date: 2003-03-10T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1879157
zbMATH Keywords: robustness
zbMATH Keywords: geometric rounding
zbMATH Keywords: arrangements
MaRDI profile type: Publication
cites work: Applications of a new space-partitioning technique
cites work: An optimal algorithm for intersecting line segments in the plane
cites work: Efficient ray shooting and hidden surface removal
cites work: Q4344150
cites work: Vertex-rounding a three-dimensional polyhedral subdivision
cites work: Rounding Arrangements Dynamically
cites work: Practical segment intersection with finite precision output
cites work: Rotational polygon containment and minimum enclosure using only robust 2D constructions
cites work: Shortest path geometric rounding
cites work: Q4945515
cites work: Q4401025
full work available at URL: s0925-7721(01)00064-5
OpenAlex ID: W2032286430
Recommended article: Iterated snap rounding with bounded drift
Recommended article: Stable snap rounding
Recommended article: Q2999657
Recommended article: Improved output-sensitive snap rounding
Recommended article: Q3619944
Recommended article: Q5115798
Recommended article: Snap rounding of Bézier curves
Recommended article: An intersection-sensitive algorithm for snap rounding
description: scientific article; zbMATH DE number 1879157