Finding compact coordinate representations for polygons and polyhedra

Victor Milenkovic, L. R. Nackman

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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
Volume34
Issue number5
StatePublished - Sep 1990
Externally publishedYes

Fingerprint

Digital arithmetic

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Finding compact coordinate representations for polygons and polyhedra. / Milenkovic, Victor; Nackman, L. R.

In: IBM Journal of Research and Development, Vol. 34, No. 5, 09.1990, p. 753-769.

Research output: Contribution to journalArticle

@article{6996c90d6ff84023892e03e386410ad4,
title = "Finding compact coordinate representations for polygons and polyhedra",
abstract = "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.",
author = "Victor Milenkovic and Nackman, {L. R.}",
year = "1990",
month = "9",
language = "English (US)",
volume = "34",
pages = "753--769",
journal = "IBM Journal of Research and Development",
issn = "0018-8646",
publisher = "IBM Corporation",
number = "5",

}

TY - JOUR

T1 - Finding compact coordinate representations for polygons and polyhedra

AU - Milenkovic, Victor

AU - Nackman, L. R.

PY - 1990/9

Y1 - 1990/9

N2 - 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.

AB - 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.

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

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

M3 - Article

AN - SCOPUS:0025480035

VL - 34

SP - 753

EP - 769

JO - IBM Journal of Research and Development

JF - IBM Journal of Research and Development

SN - 0018-8646

IS - 5

ER -