Minimum convex partition of a constrained point set-Reference-Cited by-同舟云学术

Minimum convex partition of a constrained point set

Published:2001-04 Issue:1-2 Volume:109 Page:95-107
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Fevens Thomas,Meijer Henk,Rappaport David

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference9 articles.

1. Polynomial-time instances of the Minimum Weight Triangulation problem;Anagnostou;Comput. Geom. Theory Appl.,1993

2. D. Avis, D. Rappaport, Computing the largest empty convex subset of a set of points, Proc. 1st Ann. ACM Sympos. Comput. Geom., 1985, pp. 161–167.

3. T. Fevens, H. Meijer, D. Rappaport, Minimum weight convex quadrangulation of a constrained Point Set, Abstracts from second Annual CGC Workshop on Computational Geometry, Durham, NC, October 1997.

4. The decomposition of polygons into convex parts;Greene,1983

5. Decomposing a polygon into simpler components;Keil;SIAM J. Comput.,1985

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

1. Computing the coarseness of a bicolored point set on the plane over guillotine partitions;2023 42nd IEEE International Conference of the Chilean Computer Science Society (SCCC);2023-10-23

2. Solving the minimum convex partition of point sets with integer programming;Computational Geometry;2021-12

3. Convex Quadrangulations of Bichromatic Point Sets;International Journal of Computational Geometry & Applications;2019-12

4. On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point Sets;Graphs and Combinatorics;2019-09-04

5. Minimum Convex Partition of Point Sets;Lecture Notes in Computer Science;2019