Finding compact coordinate representations for polygons and polyhedra

Victor Milenkovic, Lee R. Nackman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

A standard technique in solid modeling is to represent planes (or lines) by explicit equations and to represent vertices and edges implicitly by means of combinatorial information. Numerical problems that arise from using floating-point arithmetic to implement operations on solids can be avoided by using exact arithmetic . Since the execution time of exact arithmetic operators increases with the number of bits required to represent the operands, it is important to avoid increasing the number of bits required to represent the plane (or line) equation coefficients. Set operations on solids do not increase the number of bits required. However, rotating a solid greatly increases the number of bits required, thus adversely affecting efficiency. One proposed solution to this problem is to round the coefficients of each plane (or line) equation without altering the combinatorial information. We show that such rounding is NP-complete.

Original languageEnglish (US)
Title of host publicationProc Sixth Annu Symp Comput Geom
PublisherPubl by ACM
Pages244-252
Number of pages9
ISBN (Print)0897913620
StatePublished - 1990
Externally publishedYes
EventProceedings of the Sixth Annual Symposium on Computational Geometry - Berkeley, CA, USA
Duration: Jun 6 1990Jun 8 1990

Other

OtherProceedings of the Sixth Annual Symposium on Computational Geometry
CityBerkeley, CA, USA
Period6/6/906/8/90

Fingerprint

Digital arithmetic

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Milenkovic, V., & Nackman, L. R. (1990). Finding compact coordinate representations for polygons and polyhedra. In Proc Sixth Annu Symp Comput Geom (pp. 244-252). Publ by ACM.

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

Proc Sixth Annu Symp Comput Geom. Publ by ACM, 1990. p. 244-252.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Milenkovic, V & Nackman, LR 1990, Finding compact coordinate representations for polygons and polyhedra. in Proc Sixth Annu Symp Comput Geom. Publ by ACM, pp. 244-252, Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, 6/6/90.
Milenkovic V, Nackman LR. Finding compact coordinate representations for polygons and polyhedra. In Proc Sixth Annu Symp Comput Geom. Publ by ACM. 1990. p. 244-252
Milenkovic, Victor ; Nackman, Lee R. / Finding compact coordinate representations for polygons and polyhedra. Proc Sixth Annu Symp Comput Geom. Publ by ACM, 1990. pp. 244-252
@inproceedings{bdb52979335f4ccd83ecf9e5a165bd32,
title = "Finding compact coordinate representations for polygons and polyhedra",
abstract = "A standard technique in solid modeling is to represent planes (or lines) by explicit equations and to represent vertices and edges implicitly by means of combinatorial information. Numerical problems that arise from using floating-point arithmetic to implement operations on solids can be avoided by using exact arithmetic . Since the execution time of exact arithmetic operators increases with the number of bits required to represent the operands, it is important to avoid increasing the number of bits required to represent the plane (or line) equation coefficients. Set operations on solids do not increase the number of bits required. However, rotating a solid greatly increases the number of bits required, thus adversely affecting efficiency. One proposed solution to this problem is to round the coefficients of each plane (or line) equation without altering the combinatorial information. We show that such rounding is NP-complete.",
author = "Victor Milenkovic and Nackman, {Lee R.}",
year = "1990",
language = "English (US)",
isbn = "0897913620",
pages = "244--252",
booktitle = "Proc Sixth Annu Symp Comput Geom",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Finding compact coordinate representations for polygons and polyhedra

AU - Milenkovic, Victor

AU - Nackman, Lee R.

PY - 1990

Y1 - 1990

N2 - A standard technique in solid modeling is to represent planes (or lines) by explicit equations and to represent vertices and edges implicitly by means of combinatorial information. Numerical problems that arise from using floating-point arithmetic to implement operations on solids can be avoided by using exact arithmetic . Since the execution time of exact arithmetic operators increases with the number of bits required to represent the operands, it is important to avoid increasing the number of bits required to represent the plane (or line) equation coefficients. Set operations on solids do not increase the number of bits required. However, rotating a solid greatly increases the number of bits required, thus adversely affecting efficiency. One proposed solution to this problem is to round the coefficients of each plane (or line) equation without altering the combinatorial information. We show that such rounding is NP-complete.

AB - A standard technique in solid modeling is to represent planes (or lines) by explicit equations and to represent vertices and edges implicitly by means of combinatorial information. Numerical problems that arise from using floating-point arithmetic to implement operations on solids can be avoided by using exact arithmetic . Since the execution time of exact arithmetic operators increases with the number of bits required to represent the operands, it is important to avoid increasing the number of bits required to represent the plane (or line) equation coefficients. Set operations on solids do not increase the number of bits required. However, rotating a solid greatly increases the number of bits required, thus adversely affecting efficiency. One proposed solution to this problem is to round the coefficients of each plane (or line) equation without altering the combinatorial information. We show that such rounding is NP-complete.

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

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

M3 - Conference contribution

SN - 0897913620

SP - 244

EP - 252

BT - Proc Sixth Annu Symp Comput Geom

PB - Publ by ACM

ER -