• DOI:10.1109/SFCS.1986.19
Corpus ID: 2624319

Finite-resolution computational geometry

@article{Greene1986FiniteresolutionCG,
  title={Finite-resolution computational geometry},
  author={D. Greene and F. Yao},
  journal={27th Annual Symposium on Foundations of Computer Science (sfcs 1986)},
  year={1986},
  pages={143-152}
}

D. Greene, F. Yao

Published 1986

Computer Science

27th Annual Symposium on Foundations of Computer Science (sfcs 1986)

Geometric algorithms are usually designed with continuous parameters in mind. When the underlying geometric space is intrinsically discrete, as is the case for computer graphics problems, such algorithms are apt to give invalid solutions if properties of a finite-resolution space are not taken into account. In this paper we discuss an approach for transforming geometric concepts and algorithms from the continuous domain to the discrete domain. As an example we consider the discrete version of… CONTINUE READING

View on IEEE

researchgate.net

Save to Library

Create Alert

Cite

Launch Research Feed