Computational geometry column 58-Reference-Cited by-同舟云学术

Computational geometry column 58

Published:2013-12-10 Issue:4 Volume:44 Page:73-78
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Dumitrescu Adrian¹,Jiang Minghui²

Affiliation:

1. Department of Computer Science, University of Wisconsin--Milwaukee

2. Department of Computer Science, Utah State University, Logan

Abstract

This column is devoted to opaque sets also known as barriers. A set of curves Γ that meet every line which intersects a given convex body B is called an opaque set or barrier for B . Although the shape and length of shortest barriers for simple bodies, such as a unit equilateral triangle or a unit square are seldom disputed, no proof of optimality is known or appears to be even near in sight.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/2556663.2556679

Reference23 articles.

1. An algorithm for determining an opaque minimal forest of a convex polygon

2. Some opaque subsets of a square.

3. The Opaque Cube Problem

4. Curves Intersecting Certain Sets of Great-Circles on the Sphere

5. Unsolved Problems in Geometry

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

1. A lower bound on opaque sets;Computational Geometry;2019-07

2. Improving the lower bound on opaque sets for equilateral triangle;Discrete Applied Mathematics;2016-11

3. Computing Opaque Interior Barriers à la Shermer;SIAM Journal on Discrete Mathematics;2015-01

4. The Opaque Square;Proceedings of the thirtieth annual symposium on Computational geometry;2014-06-08