On the public citation graph

Efficient and reliable triangulation of polygons

0 signed · 27 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/bf01905693openalex-snapshot
Efficient triangulation of simple polygons
inferredcites →https://doi.org/10.1007/bf02574703openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1007/bfb0014497openalex-snapshot
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator
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)90012-4openalex-snapshot
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
inferredcites →https://doi.org/10.1016/b978-0-12-543457-7.50059-0openalex-snapshot
Fast Polygon Triangulation Based on Seidel's Algorithm
inferredcites →https://doi.org/10.1016/j.comgeo.2010.03.003openalex-snapshot
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
inferredcites →https://doi.org/10.1063/1.4823371openalex-snapshot
Computational Geometry in C
inferredcites →https://doi.org/10.1080/00029890.1975.11993898openalex-snapshot
Polygons Have Ears
inferredcites →https://doi.org/10.1080/09747338.1997.11415666openalex-snapshot
Personal Communication
inferredcites →https://doi.org/10.1109/2945.675649openalex-snapshot
Efficient collision detection using bounding volume hierarchies of k-DOPs
inferredcites →https://doi.org/10.1142/9789812831699_0003openalex-snapshot
MESH GENERATION AND OPTIMAL TRIANGULATION
inferredcites →https://doi.org/10.1142/9789814355858_0002openalex-snapshot
MESH GENERATION AND OPTIMAL TRIANGULATION
inferredcites →https://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.2307/2319703openalex-snapshot
Polygons Have Ears

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3dres.04(2012)6openalex-snapshot
3D surface reconstruction from multiview photographic images using 2D edge contours
inferred← citeshttps://doi.org/10.1007/s00453-001-0028-4openalex-snapshot
FIST: Fast Industrial-Strength Triangulation of Polygons
inferred← citeshttps://doi.org/10.1016/j.cad.2016.07.013openalex-snapshot
Boolean operations on arbitrary polygonal and polyhedral meshes
inferred← citeshttps://doi.org/10.1016/j.cag.2006.10.003openalex-snapshot
Comparison of triangle strips algorithms
inferred← citeshttps://doi.org/10.1016/s0010-4485(00)00071-3openalex-snapshot
Efficiently computing and updating triangle strips for real-time rendering
inferred← citeshttps://doi.org/10.1016/s0097-8493(99)00092-8openalex-snapshot
Computing visibility from folded surfaces
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00003-7openalex-snapshot
VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
inferred← citeshttps://doi.org/10.1109/ccpqt56151.2022.00030openalex-snapshot
An Improved A* Algorithm for Roadless Networks Based on Triangular Mesh
inferred← citeshttps://doi.org/10.1109/inforino68543.2026.11556864openalex-snapshot
Procedural Algorithms for Generation of 3D Scenery Using Open GIS Data and Computer Vision
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.1145/513400.513431openalex-snapshot
Optimal decomposition of polygonal models into triangle strips
inferred← citeshttps://doi.org/10.30819/5232openalex-snapshot
Smartphone-Based 3D Indoor Localization and Navigation
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.