Finding compact coordinate representations for polygons and polyhedra

V. J. Milenkovic, L. R. Nackman

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


Practical solid modeling systems are plagued by numerical problems that arise from using floating-point arithmetic. Problems arise when numerical roundoff error in geometric operations causes the geometric information to become inconsistent with the combinatorial information. These problems can be avoided by using exact arithmetic instead of floating-point arithmetic. However, some operations, such as rotation, increase the number of bits required to represent the plane equation coefficients. Since the execution time of exact arithmetic operators increases with the number of bits in the operands, the increased number of bits in the plane equation coefficients can cause performance problems. One proposed solution to this performance problem is to round the plane equation coefficients without altering the combinatorial information. We show that such rounding is NP-complete.

Original languageEnglish (US)
Pages (from-to)753-769
Number of pages17
JournalIBM Journal of Research and Development
Issue number5
StatePublished - Jan 1 1990
Externally publishedYes

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Finding compact coordinate representations for polygons and polyhedra'. Together they form a unique fingerprint.

Cite this