scientific article; zbMATH DE number 4065813
From MaRDI portal
Publication:3799261
art gallery theoremscomputational geometryconvex partitioning algorithmsdecompositionmonotonepolygonsspiralstar-shapedtriangulationvisibility graphs
Designs and configurations (05B99) 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) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(only showing first 100 items - show all)- \(K\)-vertex guarding simple polygons
- Approximating maximum edge 2-coloring in simple graphs via local improvement
- Polygon exploration with time-discrete vision
- Finding the \(\Theta \)-guarded region
- Optimal movement of mobile sensors for barrier coverage of a planar region
- Optimum watchman routes
- Triangulations, visibility graph and reflex vertices of a simple polygon
- Triangulating a simple polygon in linear time
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- A counterexample for the sufficiency of edge guards in star polygons
- Tiling polygons with parallelograms
- Watchman routes under limited visibility
- The zookeeper route problem
- On covering orthogonal polygons with star-shaped polygons
- Computing the full visibility graph of a set of line segments
- Special subgraphs of weighted visibility graphs
- Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach
- Approximating constrained tetrahedrizations
- Edge guards in rectilinear polygons
- Randomized query processing in robot path planning
- Watchman routes in the presence of a pair of convex polygons
- Geodesic visibility in graphs
- On the number of guard edges of a polygon
- On the complexity of two circle connecting problems
- Geometric classification of triangulations and their enumeration in a convex polygon
- Guarding rectangular art galleries
- Computability and complexity of ray tracing
- Optimum placement of guards
- Camera placement in integer lattices
- Geodesic convexity in discrete spaces
- Tight bounds for the number of edge guards for spiral polygons
- Protecting convex sets
- Hiding points in arrangements of segments
- Proper interval graphs and the guard problem
- Rectangle-visibility representations of bipartite graphs
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
- Note on an art gallery problem
- Illumination by floodlights
- Recognizing weakly convex visible polygons
- Visibility with multiple diffuse reflections
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
- Art gallery theorems for guarded guards.
- Illuminating labyrinths.
- Illuminating disjoint line segments in the plane
- Art gallery problem with guards whose range of vision is \(180^{\circ}\)
- Approximation algorithms for terrain guarding.
- A necessary condition for a graph to be the visibility graph of a simple polygon
- Guarding in a simple polygon
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- Orthogonal polygon reconstruction from stabbing information
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- FO model checking on geometric graphs
- Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
- Modem illumination of monotone polygons
- Minimizing the solid angle sum of orthogonal polyhedra
- Mobile versus point guards
- Computational complexity aspects of point visibility graphs
- Improved bounds for guarding plane graphs with edges
- Finding a largest rectangle inside a digital object and rectangularization
- Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
- Deriving the accumulation density function with parabolic trajectories of particles for arbitrary lines
- The fortress problem in terms of the number of reflex and convex vertices. A 3D objects scanning application
- An efficient algorithm for finding a two-pair, and its applications
- Isomorphism of spiral polygons
- Counting problems relating to a theorem of Dirichlet
- On local transformation of polygons with visibility properties.
- Efficient visibility queries in simple polygons
- An O\((n\log n)\) algorithm for the zoo-keeper's problem
- Guarding disjoint triangles and claws in the plane
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- Negative results on characterizing visibility graphs
- Efficient piecewise-linear function approximation using the uniform metric
- Ears of triangulations and Catalan numbers
- Generalized guarding and partitioning for rectilinear polygons
- Determining bar-representability for ordered weighted graphs
- Disjoint compatible geometric matchings
- On visibility and covering by convex sets
- Algorithms for the decomposition of a polygon into convex polygons
- Tetrahedral meshes from planar cross-sections
- Generating star-shaped blocks for scaled boundary multipatch IGA
- Attraction-convexity and normal visibility
- New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
- Optimal placement of base stations in border surveillance using limited capacity drones
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- Towards fully automated inspection of large components with UAVs: offline path planning and view angle dependent optimization strategies
- A constant-factor approximation algorithm for vertex guarding a WV-polygon
- Parameter analysis for guarding terrains
- Edge guards for polyhedra in three-space
- The partial visibility curve of the Feigenbaum cascade to chaos
- Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
- Line segment visibility with sidedness constraints
- A short proof of the non-biplanarity of \(K_9\)
- Vertex-to-point conflict-free chromatic guarding is NP-hard
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
- Scaled boundary parametrizations in isogeometric analysis
- Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
- Partial domination of maximal outerplanar graphs
- Finding minimum witness sets in orthogonal polygons
- Clearing an orthogonal polygon to find the evaders
- Pseudo centre and its applications
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)
