Guarding galleries and terrains (Q845875)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Guarding galleries and terrains	scientific article

Statements

scholarly article

0 references

Guarding galleries and terrains (English)

0 references

0 references

Sariel Har-Peled

0 references

Information Processing Letters

0 references

publication date

29 January 2010

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ipl.2006.05.014

0 references

Almost optimal set covers in finite VC-dimension

0 references

On the combinatorial and algebraic complexity of quantifier elimination

0 references

Algorithms for polytope covering and approximation

0 references

0 references

0 references

A linear algorithm for computing the visibility polygon from a point

0 references

Approximation algorithms for terrain guarding.

0 references

A randomized art-gallery algorithm for sensor placement

0 references

Path Planning in 0/1/∞ Weighted Regions with Applications

0 references

0 references

An output sensitive algorithm for discrete convex hulls

0 references

An art gallery theorem for line segments in the plane

0 references

On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time

0 references

An alternative proof of the rectilinear art gallery theorem

0 references

0 references

Some NP-hard polygon decomposition problems

0 references

0 references

Guarding galleries where no point sees a small area.

0 references

Pick's Theorem Revisited

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ipl.2006.05.014

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:845875

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q845875&oldid=35150167"