On the public citation graph

On geodesic properties of polygons relevant to linear time triangulation

0 signed · 32 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.1007/bf02263430openalex-snapshot
Applications of a two-dimensional hidden-line algorithm to other geometric problems
inferredcites →https://doi.org/10.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0031-3203(82)90057-7openalex-snapshot
On a convex hull algorithm for polygons and its application to triangulation problems
inferredcites →https://doi.org/10.1016/0167-8655(84)90039-4openalex-snapshot
A new linear algorithm for triangulating monotone polygons
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.1080/00207168708803587openalex-snapshot
A new triangulation-linear class of simple polygons
inferredcites →https://doi.org/10.1109/tc.1981.1675729openalex-snapshot
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
inferredcites →https://doi.org/10.1137/0217010openalex-snapshot
An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
inferredcites →https://doi.org/10.1145/322139.322142openalex-snapshot
An Optimal Algorithm for Finding the Kernel of a Polygon
inferredcites →https://doi.org/10.1145/357337.357340openalex-snapshot
Triangulation and shape-complexity

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1996.0040openalex-snapshot
On Envelopes of Arrangements of Lines
inferred← citeshttps://doi.org/10.1007/978-1-4615-5319-9_3openalex-snapshot
Minimum Convex Partitions of Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-1-4899-0715-8_40openalex-snapshot
The Dimensions of Shape and Form
inferred← citeshttps://doi.org/10.1007/978-4-431-68093-2_3openalex-snapshot
Computational Geometry: Recent Developments
inferred← citeshttps://doi.org/10.1007/978-4-431-68123-6_26openalex-snapshot
An Output-Complexity-Sensitive Polygon Triangulation Algorithm
inferred← citeshttps://doi.org/10.1007/bf01905693openalex-snapshot
Efficient triangulation of simple polygons
inferred← citeshttps://doi.org/10.1007/bf01910632openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1007/bf01910634openalex-snapshot
An algorithm for recognizing palm polygons
inferred← citeshttps://doi.org/10.1007/s00010-020-00720-7openalex-snapshot
Starshaped sets
inferred← citeshttps://doi.org/10.1007/s10462-004-4103-5openalex-snapshot
Spatial Models for Wide-Area Visual Surveillance: Computational Approaches and Spatial Building-Blocks
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90080-sopenalex-snapshot
Testing a simple polygon for monotonicity optimally in parallel
inferred← citeshttps://doi.org/10.1016/0167-8655(90)90089-kopenalex-snapshot
The Graham scan triangulates simple polygons
inferred← citeshttps://doi.org/10.1016/0167-8655(93)90137-3openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90031-zopenalex-snapshot
Linear-time algorithms for weakly-monotone polygons
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50012-7openalex-snapshot
Polygon Decomposition
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.02.004openalex-snapshot
Rotationally monotone polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.09.001openalex-snapshot
On k-convex polygons
inferred← citeshttps://doi.org/10.1109/ipps.1993.262900openalex-snapshot
Testing a simple polygon for monotonicity optimally in parallel
inferred← citeshttps://doi.org/10.1142/s0218195919500122openalex-snapshot
Line-of-Sight Pursuit in Monotone and Scallop Polygons
inferred← citeshttps://doi.org/10.1145/160985.161163openalex-snapshot
An optimal algorithm for the two-guard problem
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.