A rational rotation method for robust geometric algorithms

John F Canny; Bruce R. Donald; Eugene K. Ressler

doi:10.1145/142675.142726

Back

Shared by

John F Canny

University of California, Berkeley

A rational rotation method for robust geometric algorithms

Article 1992 en

Authors

John F Canny
University of California, Berkeley
BD
Bruce R. Donald
ER
Eugene K. Ressler

Abstract

1 min read

Article A rational rotation method for robust geometric algorithms Share on Authors: John Canny View Profile , Bruce Donald View Profile , Eugene K. Ressler View Profile Authors Info & Claims SCG '92: Proceedings of the eighth annual symposium on Computational geometryJuly 1992 Pages 251–260https://doi.org/10.1145/142675.142726Published:01 July 1992 20citation351DownloadsMetricsTotal Citations20Total Downloads351Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

A rational rotation method for robust geometric algorithms

Abstract

Discussion(0)

Related publications

A practical method for the sparse resultant

Vex—A CAD toolbox

Editorial to the special issue

Interfacing reality (panel)

An optimal condition for determining the exact number of roots of a polynomial system

Related publications

Article1993
A practical method for the sparse resultant
Article1993

Article2009
Editorial to the special issue
Article2009

Article1997
Interfacing reality (panel)
Article1997

Article1991
An optimal condition for determining the exact number of roots of a polynomial system
Article1991