On the public citation graph
Hamiltonian triangulations for fast rendering
0 signed · 53 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.1002/jgt.3190140105openalex-snapshot
Hamiltonian cycles in planar triangulations with no separating triangles
inferredcites →https://doi.org/10.1007/3-540-51683-2_35openalex-snapshot
Triangulation in 2D and 3D space
inferredcites →https://doi.org/10.1007/3-540-51683-2_36openalex-snapshot
Hamiltonian cycles in delaunay complexes
inferredcites →https://doi.org/10.1007/bf01553883openalex-snapshot
An optimal visibility graph algorithm for triangulated simple polygons
inferredcites →https://doi.org/10.1007/bfb0015443openalex-snapshot
No quadrangulation is extremely odd
inferredcites →https://doi.org/10.1016/0020-0190(87)90124-4openalex-snapshot
A non-hamiltonian, nondegenerate delaunay triangulation
inferredcites →https://doi.org/10.1016/0031-3203(94)00139-dopenalex-snapshot
Polygonal ribbons in two and three dimensions
inferredcites →https://doi.org/10.1016/0166-218x(94)00125-wopenalex-snapshot
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
inferredcites →https://doi.org/10.1016/0196-6774(89)90007-2openalex-snapshot
Gray code sequences of partitions
inferredcites →https://doi.org/10.1016/s0734-189x(87)80169-xopenalex-snapshot
Connect-the-dots: A new heuristic
inferredcites →https://doi.org/10.1109/tit.1983.1056648openalex-snapshot
Some NP-hard polygon decomposition problems
inferredcites →https://doi.org/10.1109/tit.1985.1057060openalex-snapshot
On the convex layers of a planar set
inferredcites →https://doi.org/10.1137/0205049openalex-snapshot
The Planar Hamiltonian Circuit Problem is NP-Complete
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.1142/s0218195998000060openalex-snapshot
Two-Guard Walkability of Simple Polygons
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-45678-3_53openalex-snapshot
Small Convex Quadrangulations of Point Sets
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_64openalex-snapshot
Quadrangulations of planar sets
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_71openalex-snapshot
On hamiltonian triangulations in simple polygons (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-662-05105-4_4openalex-snapshot
Constructing Hamiltonian Triangle Strips on Quadrilateral Meshes
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_7openalex-snapshot
Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms
inferred← citeshttps://doi.org/10.1007/bfb0015443openalex-snapshot
No quadrangulation is extremely odd
inferred← citeshttps://doi.org/10.1007/s003710050160openalex-snapshot
Hierarchical generalized triangle strips
inferred← citeshttps://doi.org/10.1007/s00453-003-1062-1openalex-snapshot
Small Strictly Convex Quadrilateral Meshes of Point Sets
inferred← citeshttps://doi.org/10.1016/0031-3203(94)00139-dopenalex-snapshot
Polygonal ribbons in two and three dimensions
inferred← citeshttps://doi.org/10.1016/j.cad.2012.02.005openalex-snapshot
A sharable format for multidisciplinary finite element analysis data
inferred← citeshttps://doi.org/10.1016/j.image.2008.10.011openalex-snapshot
MPEG-4 Part 25: A graphics compression framework for XML-based scene graph formats
inferred← citeshttps://doi.org/10.1016/j.orl.2003.11.005openalex-snapshot
The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle
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/s0167-8396(02)00133-4openalex-snapshot
Experimental results on quadrangulations of sets of fixed points
inferred← citeshttps://doi.org/10.1016/s0167-8396(97)00013-7openalex-snapshot
Characterizing and efficiently computing quadrangulations of planar point sets
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00019-9openalex-snapshot
Converting triangulations to quadrangulations
inferred← citeshttps://doi.org/10.1080/136588101300304070openalex-snapshot
Easy triangle strips for TIN terrain models
inferred← citeshttps://doi.org/10.1109/visual.1996.568125openalex-snapshot
Optimizing triangle strips for fast rendering
inferred← citeshttps://doi.org/10.1137/s0097539795283954openalex-snapshot
Universal Limit Laws for Depths in Random Trees
inferred← citeshttps://doi.org/10.1142/s0219467806002197openalex-snapshot
TEMPLATE-BASED ISOCONTOURING
inferred← citeshttps://doi.org/10.1145/1044588.1044639openalex-snapshot
A novel approach to extract triangle strips for iso-surfaces in volumes
inferred← citeshttps://doi.org/10.1145/193820.193831openalex-snapshot
Computational geometry column 23
inferred← citeshttps://doi.org/10.1145/234972.234976openalex-snapshot
Time/space tradeoffs for polygon mesh rendering
inferred← citeshttps://doi.org/10.1145/237218.237367openalex-snapshot
Flipping edges in triangulations
inferred← citeshttps://doi.org/10.1145/274363.274365openalex-snapshot
Geometric compression through topological surgery
inferred← citeshttps://doi.org/10.1145/280814.280836openalex-snapshot
Real time compression of triangle mesh connectivity
inferred← citeshttps://doi.org/10.1177/0954406215597713openalex-snapshot
A review of origami applications in mechanical engineering
inferred← citeshttps://doi.org/10.17273/book.2006.1openalex-snapshot
Algorithms for triangulation construction and analisys
inferred← citeshttps://doi.org/10.22215/etd/2020-14152openalex-snapshot
Generalized Delaunay Triangulations:Graph-Theoretic Properties and Algorithms
inferred← citeshttps://doi.org/10.34917/3038333openalex-snapshot
Improved algorithms for ear-clipping triangulation
inferred← citeshttps://doi.org/10.37236/416openalex-snapshot
On Tours that contain all Edges of a Hypergraph
inferred← citeshttps://doi.org/10.5555/244979.245626openalex-snapshot
Optimizing triangle strips for fast rendering
inferred← citeshttps://doi.org/10.5821/dissertation-2117-328194openalex-snapshot
Generalized Delaunay triangulations : graph-theoretic properties and algorithms
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.