On the public citation graph
A fast las vegas algorithm for triangulating a simple polygon
0 signed · 75 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/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
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/s0019-9958(86)80033-xopenalex-snapshot
Sorting jordan sequences in linear time using level-linked search trees
inferredcites →https://doi.org/10.1109/sfcs.1987.12openalex-snapshot
Cascading divide-and-conquer: A technique for designing parallel algorithms
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.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73396openalex-snapshot
A fast Las Vegas algorithm for triangulating a simple polygon
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
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-54233-7_174openalex-snapshot
Computational geometry for the gourmet old fare and new dishes
inferred← citeshttps://doi.org/10.1007/978-1-4471-2256-2_5openalex-snapshot
Partitioning a Polygon or the Plane
inferred← citeshttps://doi.org/10.1007/978-1-4612-2628-4_27openalex-snapshot
Decomposition Algorithms in Geometry
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_9openalex-snapshot
Polyline Fitting of Planar Points Under Min-sum Criteria
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/978-3-642-60718-9_22openalex-snapshot
Construction Of The Constrained Delaunay Triangulation Of A Polygonal Domain
inferred← citeshttps://doi.org/10.1007/978-3-662-09968-1_4openalex-snapshot
Toward Extensible Spatio-Temporal Databases: An Approach Based on User-Defined Aggregates
inferred← citeshttps://doi.org/10.1007/978-981-99-3761-5_57openalex-snapshot
A Brief Overview of Randomized Algorithms
inferred← citeshttps://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferred← citeshttps://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferred← citeshttps://doi.org/10.1007/bf02187846openalex-snapshot
Polygon triangulation inO(n log logn) time with simple data structures
inferred← citeshttps://doi.org/10.1007/bf02574703openalex-snapshot
Triangulating a simple polygon in linear time
inferred← citeshttps://doi.org/10.1007/bfb0028282openalex-snapshot
An optimal algorithm for computing visibility in the plane
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1007/s00454-001-0027-xopenalex-snapshot
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1016/0010-4485(94)00003-vopenalex-snapshot
Efficient rendering of trimmed nurbs surfaces
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90111-aopenalex-snapshot
Simplified linear-time jordan sorting and polygon clipping
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90086-copenalex-snapshot
An introduction to randomized algorithms
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/1049-9652(92)90062-3openalex-snapshot
Hierarchical triangulation using cartographic coherence
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.2010.03.003openalex-snapshot
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
inferred← citeshttps://doi.org/10.1016/s0097-8493(03)00151-1openalex-snapshot
Polygon trapezoidation by sets of open trapezoids
inferred← citeshttps://doi.org/10.1080/13658816.2016.1165819openalex-snapshot
Rendering interior-filled polygonal vector data in a virtual globe
inferred← citeshttps://doi.org/10.1109/2945.694955openalex-snapshot
Topology simplification for polygonal virtual environments
inferred← citeshttps://doi.org/10.1109/comst.2017.2786748openalex-snapshot
A Survey on Quantum Channel Capacities
inferred← citeshttps://doi.org/10.1109/fscs.1990.89541openalex-snapshot
Triangulating a simple polygon in linear time
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferred← citeshttps://doi.org/10.1109/tsp.2020.3009495openalex-snapshot
Localized Analysis of Signals on the Sphere Over Polygon Regions
inferred← citeshttps://doi.org/10.1109/ukrcon.2017.8100456openalex-snapshot
An approach to triangulate area bounded simple polygons
inferred← citeshttps://doi.org/10.1109/visual.1997.663909openalex-snapshot
Controlled simplification of genus for polygonal models
inferred← citeshttps://doi.org/10.1137/s0097539791221505openalex-snapshot
An Optimal Algorithm for Computing Visibility in the Plane
inferred← citeshttps://doi.org/10.1142/s0218195906001951openalex-snapshot
POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
inferred← citeshttps://doi.org/10.1145/109648.109665openalex-snapshot
Randomized parallel algorithms for trapezoidal diagrams
inferred← citeshttps://doi.org/10.1145/160985.161172openalex-snapshot
Compliant motion in a simple polygon
inferred← citeshttps://doi.org/10.1145/195058.195112openalex-snapshot
On point location and motion planning among simplices
inferred← citeshttps://doi.org/10.1145/2487381.2487385openalex-snapshot
Automatic single-view character model reconstruction
inferred← citeshttps://doi.org/10.1145/336154.336206openalex-snapshot
Linear-time triangulation of a simple polygon made easier via randomization
inferred← citeshttps://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferred← citeshttps://doi.org/10.1145/73393.73396openalex-snapshot
A fast Las Vegas algorithm for triangulating a simple polygon
inferred← citeshttps://doi.org/10.1145/73833.73835openalex-snapshot
A deterministic algorithm for partitioning arrangements of lines and its application
inferred← citeshttps://doi.org/10.1145/73833.73854openalex-snapshot
Compliant motion in a simple polygon
inferred← citeshttps://doi.org/10.1145/73833.73875openalex-snapshot
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
inferred← citeshttps://doi.org/10.1145/98524.98533openalex-snapshot
Polygon triangulation in O ( n log log n ) time with simple data-structures
inferred← citeshttps://doi.org/10.11606/d.45.2019.tde-22082019-134801openalex-snapshot
Single source shortest paths in simple 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.3813/aaa.918049openalex-snapshot
Geometry Reduction in Room Acoustics Modeling
inferred← citeshttps://doi.org/10.4156/jcit.vol6.issue6.13openalex-snapshot
An Improved Algorithm for Euclidean Shortest Paths of Visiting Line Segments in the Plane
inferred← citeshttps://doi.org/10.47839/ijc.16.3.899openalex-snapshot
TRIANGULATING A REGION BETWEEN ARBITRARY POLYGONS
inferred← citeshttps://doi.org/10.5555/2722129.2722239openalex-snapshot
Detecting weakly simple polygons
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.