Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
type: Item
instance of: scholarly article
title: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
zbMATH Open document ID: 0732.68099
DOI: 10.1145/77635.77639
author: E. P. Mücke
author: Herbert Edelsbrunner
published in: ACM Transactions on Graphics
publication date: 1990-01-01T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/9410209
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 4211549
zbMATH Keywords: reliability
zbMATH Keywords: robustness
zbMATH Keywords: degenerate data
zbMATH Keywords: determinants
zbMATH Keywords: perturbation
zbMATH Keywords: programming tool
zbMATH Keywords: geometric algorithms
zbMATH Keywords: geometric software
MaRDI profile type: Publication
OpenAlex ID: W2008581147
arXiv ID: math/9410209
Recommended article: Q4335189
Recommended article: Simplicial algorithms on the simplotope
Recommended article: Q3321853
Recommended article: General similitude solutions and low-complexity geometric models
Recommended article: Q3787804
Recommended article: Q3809109
Recommended article: A New Triangulation for Simplicial Algorithms
Recommended article: A simple method for resolving degeneracies in Delaunay triangulations
description: scientific article