Abstract
dc:descriptionComputational geometry is the branch of complexity theory that deals with geometrical problems, and has received much attention in recent years. Presented here are analyses of algorithms and complexity results for certain geometrical problems.
Degree
thesis:*- 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
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Supowit, Kenneth Jay
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (UMI)AAI8127711
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/66456