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

Akman, V. (1987). An algorithm for determining an opaque minimal forest of a convex polygon.

Type

Unclassified

Intellectual base

Unclassified

Year

1987

DOI

10.1016/0020-0190(87)90185-2

Link

https://doi.org/10.1016/0020-0190(87)90185-2

Cited by

1 citation across 1 artifact.

Domain-specific

• Opaque set
  • Connected and disconnected barriers, allowed carrier shapes and whether endpoints and boundary count must be fixed; minimizing total length remains difficult even for simple bodies.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:403d19ea457e · see in the full table