scientific article; zbMATH DE number 4065813
From MaRDI portal
Publication:3799261
decompositioncomputational geometrytriangulationpolygonsmonotonestar-shapedspiralvisibility graphsart gallery theoremsconvex partitioning algorithms
Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Polyhedra and polytopes; regular figures, division of spaces (51M20) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Other problems of combinatorial convexity (52A37) Designs and configurations (05B99)
Recommendations
Cited in
(only showing first 100 items - show all)- A theory of spherical diagrams
- On colourability of polygon visibility graphs
- Radial drawings of graphs: geometric constraints and trade-offs
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
- Approximating maximum edge 2-coloring in simple graphs
- Gender-aware facility location in multi-gender world
- Visibility with multiple reflections
- Scaled boundary parametrizations in isogeometric analysis
- Clearing an orthogonal polygon to find the evaders
- Attraction-convexity and normal visibility
- scientific article; zbMATH DE number 3520315 (Why is no real title available?)
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
- Art gallery problem with guards whose range of vision is \(180^{\circ}\)
- Efficient visibility queries in simple polygons
- Improved approximation for guarding simple galleries from the perimeter
- A note on the contractions for orthogonal polygons
- How to guard orthogonal polygons: diagonal graphs and vertex covers
- Towards fully automated inspection of large components with UAVs: offline path planning and view angle dependent optimization strategies
- Guarding disjoint triangles and claws in the plane
- Pseudo centre and its applications
- Searching a polygonal region by a group of stationary \(k\)-searchers
- scientific article; zbMATH DE number 140478 (Why is no real title available?)
- Orbiting triangle method for convex polygon triangulation
- A necessary condition for a graph to be the visibility graph of a simple polygon
- Approximating constrained tetrahedrizations
- Geometric classification of triangulations and their enumeration in a convex polygon
- Computing in linear time a chord from which a simple polygon is weakly internally visible
- The art gallery problem is \(\exists \mathbb{R}\)-complete
- Computational complexity aspects of point visibility graphs
- Connected proper interval graphs and the guard problem in spiral polygons (extended abstract)
- Watchman routes under limited visibility
- Extension to Even Triangulations
- Inapproximability of finding maximum hidden sets on polygons and terrains
- Altitude terrain guarding and guarding uni-monotone polygons
- On local transformation of polygons with visibility properties.
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Analysis of spatial and spatiotemporal anomalies using persistent homology: case studies with COVID-19 data
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Minimization of the maximum distance between the two guards patrolling a polygonal region
- Improved bounds for guarding plane graphs with edges
- Optimal sensor positioning; a probability perspective study
- Approximation algorithms for decomposing octilinear polygons
- Finding the largest area axis-parallel rectangle in a polygon
- Camera placement in integer lattices
- A constant-factor approximation algorithm for vertex guarding a WV-polygon
- Obstacle numbers of graphs
- Exploring discrete geometry
- An addition to art galleries with interior walls
- Watchman routes in the presence of a pair of convex polygons
- Pentagonal chains and annuli as models for designing nanostructures from cages
- Monitoring maximal outerplanar graphs
- A multi-level optimization approach for the planning of heterogeneous sensor networks
- Decomposing the boundary of a nonconvex polyhedron
- Algorithms for the decomposition of a polygon into convex polygons
- On the complexity of half-guarding monotone polygons
- scientific article; zbMATH DE number 4062605 (Why is no real title available?)
- Recognizing weakly convex visible polygons
- Negative results on characterizing visibility graphs
- Finding a largest rectangle inside a digital object and rectangularization
- Approximation algorithms for art gallery problems in polygons
- How to guard an art gallery and other discrete mathematical adventures
- A fixed-parameter algorithm for guarding 1.5D terrains
- Edge guards for polyhedra in three-space
- Guarding curvilinear art galleries with vertex or point guards
- Algorithms and Computation
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- Monitoring the plane with rotating radars
- Approximability of guarding weak visibility polygons
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
- Two-floodlight illumination of convex polygons
- Computability and complexity of ray tracing
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
- Area requirement of visibility representations of trees
- Geodesic convexity in discrete spaces
- FO model checking on geometric graphs
- Illuminating labyrinths.
- Guarding a set of line segments in the plane
- The searchlight problem for road networks
- Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
- Guarding rectangular art galleries
- Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- A unified solving approach for two and three dimensional coverage problems in sensor networks
- Proper interval graphs and the guard problem
- On visibility and covering by convex sets
- Art gallery problem with rook and queen vision
- Illumination with orthogonal floodlights
- Computational complexity of the \(r\)-visibility guard set problem for polyominoes
- Art gallery theorems for guarded guards.
- Minimal link visibility paths inside a simple polygon
- On \(r\)-guarding SCOTs -- a new family of orthogonal polygons
- Vertex guarding for dynamic orthogonal art galleries
- Optimum watchman routes
- Protecting convex sets
- Approximation algorithms for terrain guarding.
- Cooperative mobile guards in grids
- Watchman tours for polygons with holes
- Computational complexity of art gallery problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799261)
