Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Opaque_forest_problem> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Opaque_forest_problem abstract "In computational geometry, The opaque forest problem can be stated as follows: "Given a convex polygon C in the plane, determine the minimal forest T of closed, bounded line segments such that every line through C also intersects T". T is said to be the opaque forest, or barrier of C. C is said to be the coverage of T. While any forest that covers C is a barrier of C, we wish to find the one with shortest length.It may be the case that T is constrained to be strictly interior or exterior to C. In this case, we specifically refer to a barrier as interior or exterior. Otherwise, the barrier is assumed to have no constraints on its location.".
- Opaque_forest_problem thumbnail Unit_Square_Opaque_Forest_Solutions.svg?width=300.
- Opaque_forest_problem wikiPageID "41162601".
- Opaque_forest_problem wikiPageRevisionID "591504962".
- Opaque_forest_problem subject Category:Computational_geometry.
- Opaque_forest_problem comment "In computational geometry, The opaque forest problem can be stated as follows: "Given a convex polygon C in the plane, determine the minimal forest T of closed, bounded line segments such that every line through C also intersects T". T is said to be the opaque forest, or barrier of C. C is said to be the coverage of T. While any forest that covers C is a barrier of C, we wish to find the one with shortest length.It may be the case that T is constrained to be strictly interior or exterior to C.".
- Opaque_forest_problem label "Opaque forest problem".
- Opaque_forest_problem sameAs m.0zc1j_v.
- Opaque_forest_problem sameAs Q16867981.
- Opaque_forest_problem sameAs Q16867981.
- Opaque_forest_problem wasDerivedFrom Opaque_forest_problem?oldid=591504962.
- Opaque_forest_problem depiction Unit_Square_Opaque_Forest_Solutions.svg.
- Opaque_forest_problem isPrimaryTopicOf Opaque_forest_problem.
