Minimum Decompositions of Polygonal Objects-Reference-Cited by-同舟云学术

Minimum Decompositions of Polygonal Objects

Published:1985 Issue: Volume: Page:197-216
ISSN:0923-0459
Container-title:Computational Geometry
language:
Short-container-title:

Author:

KEIL J. Mark,SACK Jorg-R.

Publisher

Elsevier

Reference53 articles.

1. N. Ahuya, R.T. Chien, R. Yen and N. Birdwell, Interference detection and collision avoidance among three dimensional objects, Proc. First Annual National Conference on Artificial Intelligence, Stanford, California, 1980, 44–48.

2. T. Asano and T. Asano, Minimum Partition of Polygonal Regions into Trapezoids, Proc. 24th Annual Symposium on Foundations of Computer Science, 1983, 233–241.

3. T. Asano, T. Asano and Y. Ohsuga, Partitioning polygonal regions into triangles, Papers of Technical Groups of IECE, CAS83–98, 31–36.

4. On the Complexity of Finding the Convex Hull of a set of Points;Avis;Discrete Applied Mathematics,1982

5. An efficient algorithm for decomposing a polygon into star-shaped polygons;Avis;Pattern Recognition,1981

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Covering Polygons is Even Harder;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

2. Machine vision methodology for inkjet printing drop sequence generation and validation;Flexible and Printed Electronics;2021-08-25

3. A survey of mass partitions;Bulletin of the American Mathematical Society;2021-02-24

4. Water Sink Model for Robot Motion Planning;Sensors;2019-03-13

5. Optimization approaches for robot trajectory planning;Multidisciplinary Journal for Education, Social and Technological Sciences;2018-03-29