On the public citation graph

Corrections to Lee's visibility polygon algorithm

https://doi.org/10.1007/bf01937271

0 signed · 120 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nme.1620230503openalex-snapshot

Triangular meshes for regions of complicated shape

inferredcites →https://doi.org/10.1016/0196-6774(81)90019-5openalex-snapshot

A linear algorithm for computing the visibility polygon from a point

inferredcites →https://doi.org/10.1016/0734-189x(83)90065-8openalex-snapshot

Visibility of a simple polygon

inferredcites →https://doi.org/10.1109/pgec.1967.264724openalex-snapshot

An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line'' Problem

inferredcites →https://doi.org/10.1109/tc.1978.1675001openalex-snapshot

Decomposition of Polygons into Convex Sets

inferredcites →https://doi.org/10.2307/2005805openalex-snapshot

Applied and Computational Complex Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nav.22023openalex-snapshot

A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes

inferred← citeshttps://doi.org/10.1007/10991541_5openalex-snapshot

Stealth Tracking of an Unpredictable Target among Obstacles

inferred← citeshttps://doi.org/10.1007/11523468_110openalex-snapshot

Approximate Guarding of Monotone and Rectilinear Polygons

inferred← citeshttps://doi.org/10.1007/3-540-44679-6_14openalex-snapshot

On the Planar Two-Watchtower Problem

inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8_4openalex-snapshot

Maintaining the Visibility Graph of a Dynamic Simple Polygon

inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_2openalex-snapshot

Computing the k-Crossing Visibility Region of a Point in a Polygon

inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_11openalex-snapshot

Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane

inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_6openalex-snapshot

A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon

inferred← citeshttps://doi.org/10.1007/978-3-031-74758-8_4openalex-snapshot

A Proportion of Visibility Polygon’s Surface to the Entire Polygon’s Surface: A Lower Bound of the Proportion Derived for General Polygons of Any Shape and Orthogonal Polygons

inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_1openalex-snapshot

Guarding a 1.5D Terrain with Imprecise Viewpoints

inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_23openalex-snapshot

How to Draw a Planarization

inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_19openalex-snapshot

Incremental Algorithms to Update Visibility Polygons

inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_24openalex-snapshot

Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon

inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_13openalex-snapshot

Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices

inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_32openalex-snapshot

Guarding Art Galleries by Guarding Witnesses

inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_8openalex-snapshot

Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem

inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_26openalex-snapshot

Visiting a Polygon on the Optimal Way to a Query Point

inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_9openalex-snapshot

Computing the Visibility Polygon Using Few Variables

inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_19openalex-snapshot

Computing the Visibility Polygon of an Island in a Polygonal Domain

inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_30openalex-snapshot

Terrain Visibility with Multiple Viewpoints

inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_8openalex-snapshot

Optimal Algorithms for Constrained 1-Center Problems

inferred← citeshttps://doi.org/10.1007/978-3-658-37711-3_4openalex-snapshot

Durchschnitte, Zerlegungen und Sichtbarkeit

inferred← citeshttps://doi.org/10.1007/978-981-19-2130-8_47openalex-snapshot

Optimization of Algorithms for Simple Polygonizations

inferred← citeshttps://doi.org/10.1007/bf01206329openalex-snapshot

A linear-time algorithm for constructing a circular visibility diagram

inferred← citeshttps://doi.org/10.1007/bf01758855openalex-snapshot

Minimum-link paths among obstacles in the plane

inferred← citeshttps://doi.org/10.1007/bf02510177openalex-snapshot

A data modeling abstraction for describing triangular mesh algorithms

inferred← citeshttps://doi.org/10.1007/bf02573974openalex-snapshot

An upper bound for conforming Delaunay triangulations

inferred← citeshttps://doi.org/10.1007/bfb0028282openalex-snapshot

An optimal algorithm for computing visibility in the plane

inferred← citeshttps://doi.org/10.1007/s00224-020-09999-0openalex-snapshot

Computing the k-Visibility Region of a Point in a Polygon

inferred← citeshttps://doi.org/10.1007/s00453-012-9653-3openalex-snapshot

Approximate Guarding of Monotone and Rectilinear Polygons

inferred← citeshttps://doi.org/10.1007/s00453-014-9893-5openalex-snapshot

Space–Time Trade-offs for Stack-Based Algorithms

inferred← citeshttps://doi.org/10.1007/s00453-015-0058-yopenalex-snapshot

Computing the Visibility Polygon of an Island in a Polygonal Domain

inferred← citeshttps://doi.org/10.1007/s00453-018-00540-xopenalex-snapshot

Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane

inferred← citeshttps://doi.org/10.1007/s00453-024-01245-0openalex-snapshot

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon

inferred← citeshttps://doi.org/10.1007/s10559-025-00825-4openalex-snapshot

Constructing Efficient Algorithms for Solving Certain Computational Geometry Problems Using Reeb Graphs

inferred← citeshttps://doi.org/10.1007/s10878-022-00846-1openalex-snapshot

Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane

inferred← citeshttps://doi.org/10.1007/s11464-009-0049-xopenalex-snapshot

Parametric search: three new applications

inferred← citeshttps://doi.org/10.1007/s11538-023-01187-8openalex-snapshot

The Influence of Nucleus Mechanics in Modelling Adhesion-independent Cell Migration in Structured and Confined Environments

inferred← citeshttps://doi.org/10.1007/s42979-023-02561-yopenalex-snapshot

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions

inferred← citeshttps://doi.org/10.1016/0961-3552(91)90036-4openalex-snapshot

GEOMPACK — a software package for the generation of meshes using geometric algorithms

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot

Visibility in the Plane

inferred← citeshttps://doi.org/10.1016/j.cag.2015.02.010openalex-snapshot

GPU-based parallel algorithm for computing point visibility inside simple polygons

inferred← citeshttps://doi.org/10.1016/j.cag.2018.07.002openalex-snapshot

High-quality compatible triangulations and their application in interactive animation

inferred← citeshttps://doi.org/10.1016/j.cageo.2022.105228openalex-snapshot

Computational morphology of debris and alluvial fans on irregular terrain using the visibility polygon

inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.05.001openalex-snapshot

A linear time algorithm to remove winding of a simple polygon

inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.08.002openalex-snapshot

Draining a polygon—or—rolling a ball out of a polygon

inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.02.007openalex-snapshot

Normal art galleries: Wall in – all in

inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.04.001openalex-snapshot

Computing a visibility polygon using few variables

inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.08.003openalex-snapshot

Visibility and ray shooting queries in polygonal domains

inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.019openalex-snapshot

Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees

inferred← citeshttps://doi.org/10.1016/j.ipl.2015.07.004openalex-snapshot

Planar lower envelope of monotone polygonal chains

inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106362openalex-snapshot

On Voronoi visibility maps of 1.5D terrains with multiple viewpoints

inferred← citeshttps://doi.org/10.1016/j.isprsjprs.2021.07.013openalex-snapshot

Optimal scan planning with enforced network connectivity for the acquisition of three-dimensional indoor models

inferred← citeshttps://doi.org/10.1016/j.jcp.2024.113143openalex-snapshot

An unfitted high-order HDG method for two-fluid Stokes flow with exact NURBS geometries

inferred← citeshttps://doi.org/10.1016/j.mcm.2004.06.011openalex-snapshot

Deriving the accumulation density function with parabolic trajectories of particles for arbitrary lines

inferred← citeshttps://doi.org/10.1016/j.rcim.2020.101999openalex-snapshot

A framework for tool-path airtime optimization in material extrusion additive manufacturing

inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.003openalex-snapshot

Query-point visibility constrained shortest paths in simple polygons

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.017openalex-snapshot

A time–space trade-off for computing the k-visibility region of a point in a polygon

inferred← citeshttps://doi.org/10.1016/s0895-7177(01)00052-8openalex-snapshot

Computing accumulation density of particles on a line with parabolic trajectories

inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00070-0openalex-snapshot

Efficient visibility queries in simple polygons

inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00006-6openalex-snapshot

Recognizing weakly convex visible polygons

inferred← citeshttps://doi.org/10.1080/00207169008803824openalex-snapshot

On the correctness of a linear-time visibility polygon algorithm∗

inferred← citeshttps://doi.org/10.1109/12.392849openalex-snapshot

Optimal parallel hypercube algorithms for polygon problems

inferred← citeshttps://doi.org/10.1109/2945.582388openalex-snapshot

On compatible star decompositions of simple polygons

inferred← citeshttps://doi.org/10.1109/atit49449.2019.9030463openalex-snapshot

The "Divide and Conquer" technique to solve the Minimum Area Polygonalization problem

inferred← citeshttps://doi.org/10.1109/cec45853.2021.9504843openalex-snapshot

The Sectional Art Gallery and an Evolutionary Algorithm for Approaching Its Minimum Point Guard Problem

inferred← citeshttps://doi.org/10.1109/icra.2011.5979838openalex-snapshot

How many landmark colors are needed to avoid confusion in a polygon?

inferred← citeshttps://doi.org/10.1109/icra57147.2024.10611529openalex-snapshot

An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning

inferred← citeshttps://doi.org/10.1109/icsmc.2006.385298openalex-snapshot

Deriving the Accumulation Density Function with Parabolic Trajectories of Particles for Curve

inferred← citeshttps://doi.org/10.1109/iros58592.2024.10801476openalex-snapshot

TřiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments

inferred← citeshttps://doi.org/10.1109/isvd.2011.39openalex-snapshot

Voronoi-Based Potentially Visible Set and Visibility Query Algorithms

inferred← citeshttps://doi.org/10.1109/jiot.2024.3494692openalex-snapshot

Novel Computationally Efficient Multiple Access-Point/Router Deployment Approach for Full Line of Sight Coverage Over Arbitrary Indoor Polygonal/Prismatic Fields of Interest

inferred← citeshttps://doi.org/10.1109/sibgrapi.2007.15openalex-snapshot

An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem

inferred← citeshttps://doi.org/10.1109/sibgrapi.2007.7openalex-snapshot

Improved Reversible Mapping from Color to Gray

inferred← citeshttps://doi.org/10.1109/tvcg.2009.38openalex-snapshot

Compatible Embedding for 2D Shape Animation

inferred← citeshttps://doi.org/10.1137/0222036openalex-snapshot

A Quadratic Time Algorithm for the Minmax Length Triangulation

inferred← citeshttps://doi.org/10.1137/1.9781611972870.12openalex-snapshot

Locating Guards for Visibility Coverage of Polygons

inferred← citeshttps://doi.org/10.1137/1.9781611973754.9openalex-snapshot

Region-based Approximation Algorithms for Visibility between Imprecise Locations

inferred← citeshttps://doi.org/10.1137/s0097539791221505openalex-snapshot

An Optimal Algorithm for Computing Visibility in the Plane

inferred← citeshttps://doi.org/10.1142/s0218195906002002openalex-snapshot

GUARDING ART GALLERIES BY GUARDING WITNESSES

inferred← citeshttps://doi.org/10.1142/s0218195910003323openalex-snapshot

GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS

inferred← citeshttps://doi.org/10.1142/s0218195910003451openalex-snapshot

LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS

inferred← citeshttps://doi.org/10.1142/s0218195914600085openalex-snapshot

TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS

inferred← citeshttps://doi.org/10.1142/s021819592050003xopenalex-snapshot

Dynamic Algorithms for Visibility Polygons in Simple Polygons

inferred← citeshttps://doi.org/10.1145/116825.116827openalex-snapshot

An optimal parallel algorithm for the visibility of a simple polygon from a point

inferred← citeshttps://doi.org/10.1145/142675.142690openalex-snapshot

An upper bound for conforming Delaunay triangulations

inferred← citeshttps://doi.org/10.1145/2582112.2582125openalex-snapshot

Two-Point L1 Shortest Path Queries in the Plane

inferred← citeshttps://doi.org/10.1145/2951913.2951927openalex-snapshot

Experience report: growing and shrinking polygons for random testing of computational geometry algorithms

inferred← citeshttps://doi.org/10.1145/3022670.2951927openalex-snapshot

Experience report: growing and shrinking polygons for random testing of computational geometry algorithms

inferred← citeshttps://doi.org/10.1145/3232679.3232692openalex-snapshot

Computational Geometry Column 67

inferred← citeshttps://doi.org/10.1145/3493499.3493503openalex-snapshot

Interpolating concavities

inferred← citeshttps://doi.org/10.1145/3503953openalex-snapshot

Optimal Area Polygonization by Triangulation and Visibility Search

inferred← citeshttps://doi.org/10.1145/3504001openalex-snapshot

Triangle-Based Heuristics for Area Optimal Polygonizations

inferred← citeshttps://doi.org/10.1145/98524.98536openalex-snapshot

Structured visibility profiles with applications to problems in simple polygons (extended abstract)

inferred← citeshttps://doi.org/10.1145/98524.98537openalex-snapshot

Minimum-link paths among obstacles in the plane

inferred← citeshttps://doi.org/10.15439/2023f4335openalex-snapshot

A lower bound for proportion of visibility polygon's surface to entire polygon's surface: Estimated by Art Gallery Problem and proven that cannot be greatly improved

inferred← citeshttps://doi.org/10.15439/2026f5997openalex-snapshot

Weak segment visibility in simple polygons: A reflex-vertex scanning algorithm with a guaranteed-area lower bound

inferred← citeshttps://doi.org/10.17077/etd.5fmc560lopenalex-snapshot

Surveilling roads and protecting art

inferred← citeshttps://doi.org/10.20382/jocg.v7i2a5openalex-snapshot

Shortest Path to a Segment and Quickest Visibility Queries

inferred← citeshttps://doi.org/10.20868/upm.thesis.517openalex-snapshot

Métodos heurísticos en problemas geométricos. visibilidad, iluminación y vigilancia

inferred← citeshttps://doi.org/10.22215/etd/2016-11514openalex-snapshot

On Proximity Problems In Euclidean Spaces

inferred← citeshttps://doi.org/10.22215/etd/2017-12201openalex-snapshot

Reconstruction Based on Visibility

inferred← citeshttps://doi.org/10.3233/fi-2021-2075openalex-snapshot

Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons

inferred← citeshttps://doi.org/10.3724/sp.j.1089.2023.19356openalex-snapshot

Anisotropic Generalized Barycentric Coordinates and Applications

inferred← citeshttps://doi.org/10.4108/airo.3591openalex-snapshot

Advancing Robot Perception in Non-Spiral Environments through Camera-based Image Processing

inferred← citeshttps://doi.org/10.48550/arxiv.1011.1917openalex-snapshot

Normal art galleries: wall in - all in

inferred← citeshttps://doi.org/10.48550/arxiv.1101.1346openalex-snapshot

Fast Approximation Algorithms for Art Gallery Problems in Simple Polygons

inferred← citeshttps://doi.org/10.48550/arxiv.1111.3584openalex-snapshot

Computing a visibility polygon using few variables

inferred← citeshttps://doi.org/10.48550/arxiv.1208.3663openalex-snapshot

Space-Time Trade-offs for Stack-Based Algorithms

inferred← citeshttps://doi.org/10.48550/arxiv.1403.3458openalex-snapshot

Two-Point $L_1$ Shortest Path Queries in the Plane

inferred← citeshttps://doi.org/10.48550/arxiv.1403.3905openalex-snapshot

Efficient Computation of Visibility Polygons

inferred← citeshttps://doi.org/10.48550/arxiv.2011.09925openalex-snapshot

Visibility Polygons and Visibility Graphs among Dynamic Polygonal Obstacles in the Plane

inferred← citeshttps://doi.org/10.52547/ijmsi.17.2.235openalex-snapshot

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

inferred← citeshttps://doi.org/10.70675/b0a73443z382dz4d7cz85c2zb7294064e801openalex-snapshot

Simulation of two-fluid immiscible Stokes flows using hybrid nonconforming methods and geometrically unfitted meshes

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.