A geometric consistency theorem for a symbolic perturbation scheme

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In a previous paper, we introduced a generic solution to the problem of data degeneracy in geometric algorithms. The scheme is simple to use: algorithms qualifying under our requirements just have to use a prescribed blackbox for polynomial evaluation in order to achieve a symbolic perturbation of data. In this paper, we introduce the concept of an infinitesimal perturbation and show that our method is consistent relative to such perturbations.

Original languageEnglish (US)
Title of host publicationProceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988
PublisherAssociation for Computing Machinery, Inc
Pages134-142
Number of pages9
ISBN (Electronic)0897912705, 9780897912709
DOIs
StatePublished - Jan 6 1988
Event4th Annual Symposium on Computational Geometry, SCG 1988 - Urbana-Champaign, United States
Duration: Jun 6 1988Jun 8 1988

Other

Other4th Annual Symposium on Computational Geometry, SCG 1988
CountryUnited States
CityUrbana-Champaign
Period6/6/886/8/88

Fingerprint

Perturbation
Theorem
Polynomial Evaluation
Geometric Algorithms
Black Box
Degeneracy
Requirements
Concepts

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Yap, C. (1988). A geometric consistency theorem for a symbolic perturbation scheme. In Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988 (pp. 134-142). Association for Computing Machinery, Inc. https://doi.org/10.1145/73393.73407

A geometric consistency theorem for a symbolic perturbation scheme. / Yap, Chee.

Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. Association for Computing Machinery, Inc, 1988. p. 134-142.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yap, C 1988, A geometric consistency theorem for a symbolic perturbation scheme. in Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. Association for Computing Machinery, Inc, pp. 134-142, 4th Annual Symposium on Computational Geometry, SCG 1988, Urbana-Champaign, United States, 6/6/88. https://doi.org/10.1145/73393.73407
Yap C. A geometric consistency theorem for a symbolic perturbation scheme. In Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. Association for Computing Machinery, Inc. 1988. p. 134-142 https://doi.org/10.1145/73393.73407
Yap, Chee. / A geometric consistency theorem for a symbolic perturbation scheme. Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. Association for Computing Machinery, Inc, 1988. pp. 134-142
@inproceedings{cda2264757104c3aaec4f9ac293c89cb,
title = "A geometric consistency theorem for a symbolic perturbation scheme",
abstract = "In a previous paper, we introduced a generic solution to the problem of data degeneracy in geometric algorithms. The scheme is simple to use: algorithms qualifying under our requirements just have to use a prescribed blackbox for polynomial evaluation in order to achieve a symbolic perturbation of data. In this paper, we introduce the concept of an infinitesimal perturbation and show that our method is consistent relative to such perturbations.",
author = "Chee Yap",
year = "1988",
month = "1",
day = "6",
doi = "10.1145/73393.73407",
language = "English (US)",
pages = "134--142",
booktitle = "Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - A geometric consistency theorem for a symbolic perturbation scheme

AU - Yap, Chee

PY - 1988/1/6

Y1 - 1988/1/6

N2 - In a previous paper, we introduced a generic solution to the problem of data degeneracy in geometric algorithms. The scheme is simple to use: algorithms qualifying under our requirements just have to use a prescribed blackbox for polynomial evaluation in order to achieve a symbolic perturbation of data. In this paper, we introduce the concept of an infinitesimal perturbation and show that our method is consistent relative to such perturbations.

AB - In a previous paper, we introduced a generic solution to the problem of data degeneracy in geometric algorithms. The scheme is simple to use: algorithms qualifying under our requirements just have to use a prescribed blackbox for polynomial evaluation in order to achieve a symbolic perturbation of data. In this paper, we introduce the concept of an infinitesimal perturbation and show that our method is consistent relative to such perturbations.

UR - http://www.scopus.com/inward/record.url?scp=85034770868&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034770868&partnerID=8YFLogxK

U2 - 10.1145/73393.73407

DO - 10.1145/73393.73407

M3 - Conference contribution

SP - 134

EP - 142

BT - Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988

PB - Association for Computing Machinery, Inc

ER -