On k-convex polygons-Reference-Cited by-同舟云学术

On k-convex polygons

Published:2012-04 Issue:3 Volume:45 Page:73-87
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Aichholzer Oswin,Aurenhammer Franz,Demaine Erik D.,Hurtado Ferran,Ramos Pedro,Urrutia Jorge

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference37 articles.

1. O. Aichholzer, F. Aurenhammer, T. Hackl, F. Hurtado, P.A. Ramos, J. Urrutia, P. Valtr, B. Vogtenhuber, k-Convex points sets, manuscript, 2011.

2. O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, J. Urrutia, B. Vogtenhuber, Modem illumination of monotone polygons, in: Proc. 25th European Workshop on Computational Geometry EuroCG ʼ09, Brussels, Belgium, 2009, pp. 167–170.

3. Decompositions, partitions, and coverings with convex polygons and pseudo-triangles;Aichholzer;Graphs and Combinatorics,2007

4. G. Aloupis, P. Bose, V. Dujmovic, C. Gray, S. Langerman, B. Speckmann, Triangulating and guarding realistic polygons, in: Proc. 20th Canadian Conference on Computational Geometry, 2008.

5. Convex partitions of graphs;Artigas;Electronic Notes in Discrete Mathematics,2007

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

1. On Erdős–Szekeres-type problems for k-convex point sets;European Journal of Combinatorics;2020-10

2. Data structures meet cryptography: 3SUM with preprocessing;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06

3. Convex Shape Prior for Multi-Object Segmentation Using a Single Level Set Function;2019 IEEE/CVF International Conference on Computer Vision (ICCV);2019-10

4. On Erdős–Szekeres-Type Problems for k-convex Point Sets;Lecture Notes in Computer Science;2019

5. Holes in 2-convex point sets;Computational Geometry;2018-10