On the public citation graph

Hamiltonian triangulations for fast rendering

0 signed · 101 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/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/3-540-63307-3_71openalex-snapshot
On hamiltonian triangulations in simple polygons (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-642-58043-7_3openalex-snapshot
Backwards Analysis of Randomized Geometric Algorithms
inferredcites →https://doi.org/10.1007/bf01553883openalex-snapshot
An optimal visibility graph algorithm for triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02187874openalex-snapshot
Triangulating point sets in space
inferredcites →https://doi.org/10.1007/bf02570708openalex-snapshot
Hamiltonian simple polytopes
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.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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.1137/1.9781611970166openalex-snapshot
Combinatorial Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1998.0979openalex-snapshot
Open Problems Presented at SCG'98
inferred← citeshttps://doi.org/10.1007/11534273_19openalex-snapshot
Hinged Dissection of Polypolyhedra
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_40openalex-snapshot
Optimal Algorithms for Two-Guard Walkability of Simple Polygons
inferred← citeshttps://doi.org/10.1007/3-540-46080-2_12openalex-snapshot
Efficient Implementation of Multiresolution Triangle Strips
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-030-68211-8_21openalex-snapshot
Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-22025-8_13openalex-snapshot
Fast Triangle Strip Generation and Tunneling for Different Cost Metrics
inferred← citeshttps://doi.org/10.1007/978-3-319-77028-4_87openalex-snapshot
Degree Aware Triangulation of Annular Regions
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_10openalex-snapshot
Approximations for Two Decomposition-Based Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_27openalex-snapshot
The Traveling Salesman Problem for Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77871-4_5openalex-snapshot
Counting Targets with Mobile Sensors in an Unknown Environment
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_1openalex-snapshot
Graph-Theoretic Solutions to Computational Geometry Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-12651-2_2openalex-snapshot
3D Mesh Compression
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_28openalex-snapshot
Upper Bound Constructions for Untangling Planar Geometric Graphs
inferred← citeshttps://doi.org/10.1007/s00371-006-0018-2openalex-snapshot
Single-strips for fast interactive rendering
inferred← citeshttps://doi.org/10.1007/s00371-006-0069-4openalex-snapshot
A high-capacity steganographic approach for 3D polygonal meshes
inferred← citeshttps://doi.org/10.1007/s00371-015-1100-4openalex-snapshot
Efficient EMD and Hilbert spectra computation for 3D geometry processing and analysis via space-filling curve
inferred← citeshttps://doi.org/10.1007/s00373-011-1024-3openalex-snapshot
Continuous Blooming of Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/s40590-015-0080-8openalex-snapshot
Hamiltonian tetrahedralizations with Steiner points
inferred← citeshttps://doi.org/10.1007/s41693-023-00096-5openalex-snapshot
Path planning for graded concrete element fabrication
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.cag.2006.10.003openalex-snapshot
Comparison of triangle strips algorithms
inferred← citeshttps://doi.org/10.1016/j.cag.2025.104292openalex-snapshot
Real-time meshlet decompression
inferred← citeshttps://doi.org/10.1016/j.cagd.2021.102039openalex-snapshot
Affine invariant triangulations
inferred← citeshttps://doi.org/10.1016/j.dam.2006.06.010openalex-snapshot
Connecting colored point sets
inferred← citeshttps://doi.org/10.1016/j.dam.2014.12.006openalex-snapshot
The cost of perfection for matchings in graphs
inferred← citeshttps://doi.org/10.1016/j.future.2004.05.028openalex-snapshot
Efficiently using connectivity information between triangles in a mesh for real-time rendering
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.12.001openalex-snapshot
Graham triangulations and triangulations with a center are hamiltonean
inferred← citeshttps://doi.org/10.1016/j.jda.2014.02.001openalex-snapshot
A new upper bound for the traveling salesman problem in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.jvcir.2005.03.001openalex-snapshot
Technologies for 3D mesh compression: A survey
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.1049/iet-ipr.2017.0162openalex-snapshot
Comprehensive survey of 3D image steganography techniques
inferred← citeshttps://doi.org/10.1109/5.687837openalex-snapshot
Geometry coding and VRML
inferred← citeshttps://doi.org/10.1109/cgi.2005.1500388openalex-snapshot
Constrained strip generation and management for eff icient interactive 3D rendering
inferred← citeshttps://doi.org/10.1109/iccsa.2010.45openalex-snapshot
Adaptive Keyframing Animation on the GPU Using Triangle Strips
inferred← citeshttps://doi.org/10.1109/igarss.2005.1526794openalex-snapshot
An approach to improve rendering performance of large multiresolution phototextured terrain models using efficient triangle strip generation
inferred← citeshttps://doi.org/10.1109/ispa58351.2023.10278690openalex-snapshot
Finding Hamiltonian Cycles with Graph Neural Networks
inferred← citeshttps://doi.org/10.1109/itcc.2001.918840openalex-snapshot
Geometric compression for fast transmission
inferred← citeshttps://doi.org/10.1109/pccga.2003.1238269openalex-snapshot
DStrips: dynamic triangle strips for real-time mesh simplification and rendering
inferred← citeshttps://doi.org/10.1109/pccga.2004.1348335openalex-snapshot
Controllable single-strip generation for triangulated surfaces
inferred← citeshttps://doi.org/10.1109/tvcg.2004.14openalex-snapshot
Multiresolution indexing of triangulated irregular networks
inferred← citeshttps://doi.org/10.1111/cgf.14488openalex-snapshot
Closed space‐filling curves with controlled orientation for 3D printing
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2004.00768.xopenalex-snapshot
Single‐Strip Triangulation of Manifolds with Arbitrary Topology
inferred← citeshttps://doi.org/10.1142/s0218195901000651openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 42
inferred← citeshttps://doi.org/10.1142/s021819599800031xopenalex-snapshot
Computational Geometry Column 34
inferred← citeshttps://doi.org/10.1142/s0218195999000182openalex-snapshot
ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
inferred← citeshttps://doi.org/10.1145/1101389.1101426openalex-snapshot
Using genetic algorithms to optimise triangle strips
inferred← citeshttps://doi.org/10.1145/1275808.1276489openalex-snapshot
Fast triangle reordering for vertex locality and reduced overdraw
inferred← citeshttps://doi.org/10.1145/1276377.1276489openalex-snapshot
Fast triangle reordering for vertex locality and reduced overdraw
inferred← citeshttps://doi.org/10.1145/1964921.1964962openalex-snapshot
LR
inferred← citeshttps://doi.org/10.1145/2010324.1964962openalex-snapshot
LR
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/300523.300531openalex-snapshot
Fast and effective stripification of polygonal surface models
inferred← citeshttps://doi.org/10.1145/304893.304933openalex-snapshot
Folding flat silhouettes and wrapping polyhedral packages
inferred← citeshttps://doi.org/10.1145/500559.500562openalex-snapshot
Computational geometry
inferred← citeshttps://doi.org/10.1145/513400.513429openalex-snapshot
Vertex-unfoldings of simplicial manifolds
inferred← citeshttps://doi.org/10.1145/513400.513431openalex-snapshot
Optimal decomposition of polygonal models into triangle strips
inferred← citeshttps://doi.org/10.1145/984952.984967openalex-snapshot
Fast Delaunay stripification
inferred← citeshttps://doi.org/10.1145/997817.997888openalex-snapshot
Single-strip triangulation of manifolds with arbitrary topology
inferred← citeshttps://doi.org/10.1201/9780203911211.ch16openalex-snapshot
Vertex-Unfoldings of Simplicial Manifolds
inferred← citeshttps://doi.org/10.1201/b10644-23openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.2312/egs.20031052openalex-snapshot
An Iterative Stripification Algorithm Based on Dual Graph Operations
inferred← citeshttps://doi.org/10.2312/localchapterevents/italchap/italianchapconf2007/023-029openalex-snapshot
Rewriting Rules for the Dual Graph of a Stripified CLOD Mesh
inferred← citeshttps://doi.org/10.2312/pe/vriphys/vriphys06/061-070openalex-snapshot
Partitioning Meshes into Strips using the Enhanced Tunnelling Algorithm (ETA)
inferred← citeshttps://doi.org/10.3390/ijgi7040138openalex-snapshot
An Efficient Visualization Method for Polygonal Data with Dynamic Simplification
inferred← citeshttps://doi.org/10.3929/ethz-a-005752807openalex-snapshot
On locality and related problems: Communicating, computing, exploring
inferred← citeshttps://doi.org/10.48550/arxiv.1210.5484openalex-snapshot
Hamiltonian Tetrahedralizations with Steiner Points
inferred← citeshttps://doi.org/10.48550/arxiv.1707.00826openalex-snapshot
Supporting Ruled Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0107023openalex-snapshot
Vertex-Unfoldings of Simplicial Polyhedra
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0108021openalex-snapshot
Computational Geometry Column 42
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0302030openalex-snapshot
The traveling salesman problem for cubic graphs
inferred← citeshttps://doi.org/10.5555/244979.245626openalex-snapshot
Optimizing triangle strips for fast rendering
inferred← citeshttps://doi.org/10.6688/jise.2005.21.6.11openalex-snapshot
A Simple and Efficient Triangle Strip Filtering Algorithm
inferred← citeshttps://doi.org/10.7155/jgaa.00590openalex-snapshot
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
inferred← citeshttps://doi.org/10.7190/shu-thesis-00049openalex-snapshot
Novel methods of image compression for 3D reconstruction
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.