Degeneracy control in geometric programs

Degenerate geometric data (e.g., three points on a line, four points on a circle) is known to create all sorts of special cases, some easy and some complicated, that have to be considered in implementations of geometric algorithms. Traditionally, the designers of algorithms coped with these difficulties by assuming special cases away, and left it to the unfortunate implementer to deal with data that would not satisfy the assumption.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Rosenberger, Harald

Contributors dc:contributor

• Edelsbrunner, Herbert

• Computer Science

Statement dc:rights

• Copyright 1990 Rosenberger, Harald

Language dc:language

eng

Identifier

AAI9026308
(UMI)AAI9026308

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/22735