On the public citation graph

Efficient triangulation of simple polygons

0 signed · 66 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/zamm.19790590830openalex-snapshot
Mandelbrot, B. B., Fractals: Form, Chance, and Dimension. San Francisco. W. H. Freeman and Company. 1977. 352 S., 68 Abb., $14.95
inferredcites →https://doi.org/10.1007/3-540-12689-9_105openalex-snapshot
Fast triangulation of simple polygons
inferredcites →https://doi.org/10.1007/978-3-642-83492-9_27openalex-snapshot
On Triangulating Palm Polygons in Linear Time
inferredcites →https://doi.org/10.1007/bf01901482openalex-snapshot
On geodesic properties of polygons relevant to linear time triangulation
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.1007/bf03023043openalex-snapshot
Fractals, form, chance and dimension
inferredcites →https://doi.org/10.1016/0020-0190(72)90045-2openalex-snapshot
An efficient algorith for determining the convex hull of a finite planar set
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/0167-8655(90)90089-kopenalex-snapshot
The Graham scan triangulates simple polygons
inferredcites →https://doi.org/10.1016/0925-7721(91)90003-wopenalex-snapshot
Computing bushy and thin triangulations
inferredcites →https://doi.org/10.1016/b978-0-444-87877-9.50015-7openalex-snapshot
NEW RESULTS IN COMPUTATIONAL GEOMETRY RELEVANT TO PATTERN RECOGNITION IN PRACTICE
inferredcites →https://doi.org/10.1063/1.2995555openalex-snapshot
Fractals: Form, Chance, and Dimension
inferredcites →https://doi.org/10.1080/00029890.1975.11993898openalex-snapshot
Polygons Have Ears
inferredcites →https://doi.org/10.1080/00207168708803587openalex-snapshot
A new triangulation-linear class of simple polygons
inferredcites →https://doi.org/10.1090/s0002-9939-1951-0046635-9openalex-snapshot
An Elementary Proof of the Jordan-Schoenflies Theorem
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.1109/t-c.1975.224276openalex-snapshot
Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
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/73833.73875openalex-snapshot
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
inferredcites →https://doi.org/10.2307/2324033openalex-snapshot
Anthropomorphic Polygons
inferredcites →https://doi.org/10.2307/2369986openalex-snapshot
Theorems on the Simple Finite Polygon and Polyhedron
inferredcites →https://doi.org/10.2307/3616244openalex-snapshot
60.10 Decomposition of a polygon into triangles
inferredcites →https://doi.org/10.2307/3616677openalex-snapshot
Theoretical statistics, by D. R. Cox and D. V. Hinkley. Pp xii, 511. £6. 1974. SBN 0 412 12420 3 (Chapman and Hall)
inferredcites →https://doi.org/10.5948/upo9780883859384openalex-snapshot
Ingenuity in Mathematics

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-37623-2_6openalex-snapshot
Upward Planarity Checking: “Faces Are More than Polygons”
inferred← citeshttps://doi.org/10.1007/3-540-60268-2_333openalex-snapshot
On boundary approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-97586-3_11openalex-snapshot
PolyMap: A 2D Polygon-Based Map Format for Multi-robot Autonomous Indoor Localization and Mapping
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_55openalex-snapshot
Selected Open Problems in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-34531-9_105openalex-snapshot
Ear-Clipping Based Algorithms of Generating High-Quality Polygon Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-7091-6586-7_11openalex-snapshot
Piecewise Linear Approximation of Planar Jordan Curves and Arcs: Theory and Applications
inferred← citeshttps://doi.org/10.1007/bf01900663openalex-snapshot
A heuristic triangulation algorithm for multiple planar contours using an extended double branching procedure
inferred← citeshttps://doi.org/10.1007/bf01910632openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1007/s00453-001-0028-4openalex-snapshot
FIST: Fast Industrial-Strength Triangulation of Polygons
inferred← citeshttps://doi.org/10.1016/0167-8655(93)90137-3openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1016/0167-8655(93)90141-yopenalex-snapshot
Slicing an ear using prune-and-search
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50012-7openalex-snapshot
Polygon Decomposition
inferred← citeshttps://doi.org/10.1016/j.cad.2006.06.008openalex-snapshot
Robust uniform triangulation algorithm for computer aided design
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.033openalex-snapshot
On polyhedra induced by point sets in space
inferred← citeshttps://doi.org/10.1016/j.jcp.2004.05.019openalex-snapshot
On a numerical strategy to compute gravity currents of non-Newtonian fluids
inferred← citeshttps://doi.org/10.1016/s0010-4485(02)00166-5openalex-snapshot
Traversing the machining graph of a pocket
inferred← citeshttps://doi.org/10.1080/0020739031000071511openalex-snapshot
On the role of kinesthetic thinking in computational geometry
inferred← citeshttps://doi.org/10.1080/16864360.2015.1131530openalex-snapshot
Efficient Booleans algorithms for triangulated meshes of geometric modeling
inferred← citeshttps://doi.org/10.1080/16864360.2016.1139765openalex-snapshot
Erratum
inferred← citeshttps://doi.org/10.1090/amsip/020/46openalex-snapshot
What is computational geometry
inferred← citeshttps://doi.org/10.1109/5.163405openalex-snapshot
Scanning the issue - Computational geometry (special issue intro.)
inferred← citeshttps://doi.org/10.1109/cgi.1998.694322openalex-snapshot
Efficient and reliable triangulation of polygons
inferred← citeshttps://doi.org/10.1109/icip.2003.1246940openalex-snapshot
Shape analysis algorithm based on information theory
inferred← citeshttps://doi.org/10.1109/icseng.2011.42openalex-snapshot
Ear-Slicing and Quality Triangulation
inferred← citeshttps://doi.org/10.1109/iv.1999.781552openalex-snapshot
An overview of triangulation algorithms for simple polygons
inferred← citeshttps://doi.org/10.1109/mmsp.2005.248668openalex-snapshot
Estimating Complexity of 2D Shapes
inferred← citeshttps://doi.org/10.1115/1.2039100openalex-snapshot
Determining Setup Orientations From the Visibility of Slice Geometry for Rapid Computer Numerically Controlled Machining
inferred← citeshttps://doi.org/10.1177/1063293x16660598openalex-snapshot
Automobile shape formation and simulation by a computer-aided systematic method
inferred← citeshttps://doi.org/10.15607/rss.2011.vii.011openalex-snapshot
An Art Gallery Approach to Ensuring that Landmarks are Distinguishable
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.21533/scjournal.v7i2.159openalex-snapshot
Computational Geometry Applications
inferred← citeshttps://doi.org/10.2498/cit.2000.04.07openalex-snapshot
A Contribution to Triangulation Algorithms for Simple Polygons
inferred← citeshttps://doi.org/10.32614/cran.package.tigersopenalex-snapshot
tigers: Integration of Geography, Environment, and Remote Sensing
inferred← citeshttps://doi.org/10.34917/3038333openalex-snapshot
Improved algorithms for ear-clipping triangulation
inferred← citeshttps://doi.org/10.3745/kipstb.2007.14-b.6.413openalex-snapshot
A Surface Reconstruction Method from Contours Based on Dividing Virtual Belt
inferred← citeshttps://doi.org/10.53808/kus.2022.icstem4ir.0039-seopenalex-snapshot
PSEUDO-TRIANGULATION OF MONOTONE POLYGON USING SWEEP LINE ALGORITHM
inferred← citeshttps://doi.org/10.7936/k78s4mz5openalex-snapshot
Modeling Surfaces from Volume Data Using Nonparallel Contours
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.