An Optimal Algorithm for Finding the Kernel of a Polygon
From MaRDI portal
Cited in
(54)- Visibility between two edges of a simple polygon
- Recognizing polygons, or how to spy
- On geodesic properties of polygons relevant to linear time triangulation
- Maintenance of configurations in the plane
- Optimal parallel algorithms for point-set and polygon problems
- On the number of guard edges of a polygon
- Recognizing weakly convex visible polygons
- Searching and on-line recognition of star-shaped polygons.
- The traveling salesmanpProblem for lines in the plane
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- Applications of a two-dimensional hidden-line algorithm to other geometric problems
- Staircase visibility and computation of kernels
- A linear-time algorithm for constructing a circular visibility diagram
- \(\alpha\)-kernel problem with fuzzy visibility
- Arc fibrations of planar domains
- Representing planar domains by polar parameterizations with parabolic parameter lines
- Optimizing generalized kernels of polygons
- Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
- Starshaped sets
- Minimal link visibility paths inside a simple polygon
- Approximate guarding of monotone and rectilinear polygons
- Guarding orthogonal art galleries with sliding cameras
- On circularly-hidden surface removal.
- Multiple point visibility and related problems
- High-quality surface remeshing using harmonic maps
- A new triangulation-linear class of simple polygons
- On k-convex polygons
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- TURNING SHAPE DECISION PROBLEMS INTO MEASURES
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
- SUCCESSIVE MAPPINGS: AN APPROACH TO POLYGONAL MESH SIMPLIFICATION WITH GUARANTEED ERROR BOUNDS
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
- PLANAR STRONG VISIBILITY
- Open guard edges and edge guards in simple polygons
- An O(log log n) algorithm to compute the kernel of a polygon
- Finding all weakly-visible chords of a polygon in linear time
- Line-of-sight pursuit in monotone and scallop polygons
- GUARDING ART GALLERIES BY GUARDING WITNESSES
- Finding the shortest boundary guard of a simple polygon
- Kernel-based construction operators for Boolean sum and ruled geometry
- Locked and unlocked smooth embeddings of surfaces
- Two-guarding a rectilinear polygon
- Guarding precise and imprecise polyhedral terrains with segments
- Approximation algorithms for the two-watchman route in a simple polygon
- LR-visibility in polygons
- Linear-time algorithms for weakly-monotone polygons
- Guarding a 1.5D terrain with imprecise viewpoints
- On the axial symmetry of 2D star-shaped sets
- Arc-fibration kernels of arc-spline domains
- \(H(\mathrm{curl})\)-reconstruction of piecewise polynomial fields with application to \(hp\) -- a posteriori nonconforming error analysis for Maxwell's equations
- Polynomial-time algorithms for contiguous art gallery and related problems
- Minimum vertex distance between separable convex polygons
- Computational geometry in a curved world
- Some chain visibility problems in a simple polygon
This page was built for publication: An Optimal Algorithm for Finding the Kernel of a Polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4188754)
