Abstract
How to compute and represent the Gaussian approximations of planar curved objects is described. Also considered are various applications of the Gaussian approximation to various primitive geometric operations on monotone curve segments. The exact solutions for these problems can be computed by solving simultaneous polynomial equations; however, this requires an intensive computation time. Efficient heuristic approximation algorithms using simple binary subdivisions on the original geometric components are suggested. It is shown that simple data structures such as arrays and circular lists can be used to represent the Gaussian approximations of planar curved objects.
| Original language | English |
|---|---|
| Title of host publication | Proc 90 IEEE Int Conf Rob Autom |
| Publisher | Publ by IEEE |
| Pages | 317-322 |
| Number of pages | 6 |
| ISBN (Print) | 0818620617 |
| Publication status | Published - 1990 Dec 1 |
| Event | Proceedings of the 1990 IEEE International Conference on Robotics and Automation - Cincinnati, OH, USA Duration: 1990 May 13 → 1990 May 18 |
Other
| Other | Proceedings of the 1990 IEEE International Conference on Robotics and Automation |
|---|---|
| City | Cincinnati, OH, USA |
| Period | 90/5/13 → 90/5/18 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Engineering(all)
Cite this
}
Gaussian approximations of objects bounded by algebraic curves. / Kim, Myung Soo; Lee, In Kwon.
Proc 90 IEEE Int Conf Rob Autom. Publ by IEEE, 1990. p. 317-322.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Gaussian approximations of objects bounded by algebraic curves
AU - Kim, Myung Soo
AU - Lee, In Kwon
PY - 1990/12/1
Y1 - 1990/12/1
N2 - How to compute and represent the Gaussian approximations of planar curved objects is described. Also considered are various applications of the Gaussian approximation to various primitive geometric operations on monotone curve segments. The exact solutions for these problems can be computed by solving simultaneous polynomial equations; however, this requires an intensive computation time. Efficient heuristic approximation algorithms using simple binary subdivisions on the original geometric components are suggested. It is shown that simple data structures such as arrays and circular lists can be used to represent the Gaussian approximations of planar curved objects.
AB - How to compute and represent the Gaussian approximations of planar curved objects is described. Also considered are various applications of the Gaussian approximation to various primitive geometric operations on monotone curve segments. The exact solutions for these problems can be computed by solving simultaneous polynomial equations; however, this requires an intensive computation time. Efficient heuristic approximation algorithms using simple binary subdivisions on the original geometric components are suggested. It is shown that simple data structures such as arrays and circular lists can be used to represent the Gaussian approximations of planar curved objects.
UR - http://www.scopus.com/inward/record.url?scp=0025595027&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0025595027&partnerID=8YFLogxK
M3 - Conference contribution
SN - 0818620617
SP - 317
EP - 322
BT - Proc 90 IEEE Int Conf Rob Autom
PB - Publ by IEEE
ER -