On the public citation graph
Polygon triangulation inO(n log logn) time with simple data structures
0 signed · 41 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-12689-9_105openalex-snapshot
Fast triangulation of simple polygons
inferredcites →https://doi.org/10.1007/978-4-431-68123-6_26openalex-snapshot
An Output-Complexity-Sensitive Polygon Triangulation Algorithm
inferredcites →https://doi.org/10.1007/978-94-009-3757-4_47openalex-snapshot
Computational Geometry and Morphology
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02187741openalex-snapshot
A fast las vegas algorithm for triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0020-0190(90)90111-aopenalex-snapshot
Simplified linear-time jordan sorting and polygon clipping
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/s0019-9958(86)80033-xopenalex-snapshot
Sorting jordan sequences in linear time using level-linked search trees
inferredcites →https://doi.org/10.1109/fscs.1990.89541openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
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/357337.357340openalex-snapshot
Triangulation and shape-complexity
inferredcites →https://doi.org/10.1145/357337.357341openalex-snapshot
Triangulating Simple Polygons and Equivalent Problems
inferredcites →https://doi.org/10.1145/73393.73396openalex-snapshot
A fast Las Vegas algorithm for triangulating a simple polygon
inferredcites →https://doi.org/10.1145/73833.73871openalex-snapshot
Minimum partitioning simple rectilinear polygons in O(n log log n) - time
inferredcites →https://doi.org/10.1145/800059.801143openalex-snapshot
A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer
inferredcites →https://doi.org/10.1145/800224.806787openalex-snapshot
Shading of regions on vector display devises
inferredcites →https://doi.org/10.1145/964967.801143openalex-snapshot
A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer
inferredcites →https://doi.org/10.21236/ada215110openalex-snapshot
Simplified Linear-Time Jordan Sorting and Polygon Clipping
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-3-031-20974-1_8openalex-snapshot
Passive Triangulation Attack on ORide
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_506-1openalex-snapshot
Polygon Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_506-2openalex-snapshot
Polygon Triangulation
inferred← citeshttps://doi.org/10.1007/s00233-016-9820-yopenalex-snapshot
Integral points in rational polygons: a numerical semigroup approach
inferred← citeshttps://doi.org/10.1007/s00454-011-9346-8openalex-snapshot
Computing Hereditary Convex Structures
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.11.002openalex-snapshot
Three problems about simple polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.03.005openalex-snapshot
Triangulating and guarding realistic polygons
inferred← citeshttps://doi.org/10.1016/s0166-3615(99)00008-1openalex-snapshot
Tetrahedral mesh generation for solids based on alternating sum of volumes
inferred← citeshttps://doi.org/10.1109/smi.2009.5170143openalex-snapshot
GridMesh: Fast and high quality 2D Mesh generation for interactive 3D shape modeling
inferred← citeshttps://doi.org/10.1109/ukrcon.2017.8100456openalex-snapshot
An approach to triangulate area bounded simple polygons
inferred← citeshttps://doi.org/10.1145/1542362.1542374openalex-snapshot
Computing hereditary convex structures
inferred← citeshttps://doi.org/10.12988/ces.2017.7876openalex-snapshot
A data structure to represent data sets with more than one order relation like polygons
inferred← citeshttps://doi.org/10.2139/ssrn.6146463openalex-snapshot
A Simple, Practical, and Fast Polygon Triangulation in O(n+k logk) Time
inferred← citeshttps://doi.org/10.3390/math13233837openalex-snapshot
Bidirectional Algorithms for Polygon Triangulations and (m + 2)-Angulations via Fuss–Catalan Numbers
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.