An Optimal Algorithm for Finding the Kernel of a Polygon
From MaRDI portal
Publication:4188754
DOI10.1145/322139.322142zbMath0403.68051OpenAlexW2003711098MaRDI QIDQ4188754
No author found.
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2142/74090
Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)
Related Items
Optimally computing a shortest weakly visible line segment inside a simple polygon, Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints, Minimal link visibility paths inside a simple polygon, High-quality surface remeshing using harmonic maps, Approximate guarding of monotone and rectilinear 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, Visibility between two edges of a simple polygon, Staircase visibility and computation of kernels, A linear-time algorithm for constructing a circular visibility diagram, Recognizing polygons, or how to spy, SUCCESSIVE MAPPINGS: AN APPROACH TO POLYGONAL MESH SIMPLIFICATION WITH GUARANTEED ERROR BOUNDS, OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS, PLANAR STRONG VISIBILITY, Guarding orthogonal art galleries with sliding cameras, On geodesic properties of polygons relevant to linear time triangulation, \(\alpha\)-kernel problem with fuzzy visibility, Recognizing weakly convex visible polygons, Kernel-based construction operators for Boolean sum and ruled geometry, Two-guarding a rectilinear polygon, On \(k\)-convex polygons, Computational geometry in a curved world, Some chain visibility problems in a simple polygon, Maintenance of configurations in the plane, Starshaped sets, Unnamed Item, Multiple point visibility and related problems, Searching and on-line recognition of star-shaped polygons., A new triangulation-linear class of simple polygons, Open Guard Edges and Edge Guards in Simple Polygons, Line-of-Sight Pursuit in Monotone and Scallop Polygons, Optimal parallel algorithms for point-set and polygon problems, LR-visibility in polygons, Linear-time algorithms for weakly-monotone polygons, Arc fibrations of planar domains, TURNING SHAPE DECISION PROBLEMS INTO MEASURES, Finding the shortest boundary guard of a simple polygon, Representing planar domains by polar parameterizations with parabolic parameter lines, SEARCHING A POLYGONAL REGION FROM THE BOUNDARY, Diffuse reflection radius in a simple polygon, Optimizing generalized kernels of polygons, GUARDING ART GALLERIES BY GUARDING WITNESSES, Applications of a two-dimensional hidden-line algorithm to other geometric problems, Minimum vertex distance between separable convex polygons, On circularly-hidden surface removal., On the number of guard edges of a polygon, The traveling salesmanpProblem for lines in the plane, Determining Weak Visibility of a Polygon from an Edge in Parallel
