Optimal space coverage with white convex polygons-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Optimal space coverage with white convex polygons

Published:2014-12-09 Issue:2 Volume:32 Page:341-353
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Ehsani Shayan,Fazli MohammadAmin,Ghodsi Mohammad,Safari MohammadAli

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-014-9822-1.pdf

Reference7 articles.

1. Agarwal PK, Mustafa NH (2006) Independent set of intersection graphs of convex objects in 2d. Comp Geom 34(2):83–95

2. De Castro N, Cobos FJ, Dana JC, Marquez A, Noy M (2002) Triangle-free planar graphs as segment intersection graphs. J Graph Algorithms Appl 6(1):7–26

3. Dilworth RP (1950) A decomposition theorem for partially ordered sets. Ann Math 51(1):161–166

4. Ehsani S, Fazli MA, Ghodsi M, Safari MA, Saghafian M, Tavakkoli M (2011) White space regions. In: Cerna I, Gyimothy T (eds) SOFSEM 2011: Theory and practice of computer science. Springer, Berlin, pp 226–237

5. Fischer P (1993) Finding maximum convex polygons. In: Esik Z (ed) Fundamentals of computation theory. Springer, Berlin, pp 234–243

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP