On the public citation graph
Hierarchical generalized triangle strips
0 signed · 40 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/bfb0049395openalex-snapshot
Hamiltonian triangulations for fast rendering
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.1145/274363.274365openalex-snapshot
Geometric compression through topological surgery
inferredcites →https://doi.org/10.5555/244979.245626openalex-snapshot
Optimizing triangle strips for fast rendering
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cav.1541openalex-snapshot
Virtual cubic panorama synthesis based on triangular reprojection
inferred← citeshttps://doi.org/10.1006/cviu.2000.0835openalex-snapshot
Image Analysis and Computer Vision: 1999
inferred← citeshttps://doi.org/10.1007/978-3-319-42085-1_5openalex-snapshot
A New Heuristic for Bandwidth and Profile Reductions of Matrices Using a Self-organizing Map
inferred← citeshttps://doi.org/10.1007/978-3-319-62392-4_1openalex-snapshot
An Analysis of Reordering Algorithms to Reduce the Computational Cost of the Jacobi-Preconditioned CG Solver Using High-Precision Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-24709-8_66openalex-snapshot
Variable Level of Detail Strips
inferred← citeshttps://doi.org/10.1007/978-3-540-25944-2_14openalex-snapshot
LodStrips: Level of Detail Strips
inferred← citeshttps://doi.org/10.1007/978-3-540-69387-1_10openalex-snapshot
Level-of-Detail Triangle Strips for Deforming Meshes
inferred← citeshttps://doi.org/10.1007/978-3-540-75274-5_2openalex-snapshot
Efficient Rendering of High-Detailed Objects Using a Reduced Multi-resolution Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-32316-4_10openalex-snapshot
Representing Terrain with Mathematical Operators
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/s00366-004-0301-7openalex-snapshot
Fractality of refined triangular grids and space-filling curves
inferred← citeshttps://doi.org/10.1007/s00371-006-0018-2openalex-snapshot
Single-strips for fast interactive rendering
inferred← citeshttps://doi.org/10.1016/j.cad.2003.09.007openalex-snapshot
Geometric model simplification for distributed CAD
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/s0010-4485(00)00071-3openalex-snapshot
Efficiently computing and updating triangle strips for real-time rendering
inferred← citeshttps://doi.org/10.1109/itcc.2001.918840openalex-snapshot
Geometric compression for fast transmission
inferred← citeshttps://doi.org/10.1109/pccga.2004.1348335openalex-snapshot
Controllable single-strip generation for triangulated surfaces
inferred← citeshttps://doi.org/10.1109/sibgra.2000.883904openalex-snapshot
Variable resolution 4-k meshes
inferred← citeshttps://doi.org/10.1109/titb.2002.806096openalex-snapshot
A discrete curvature-based deformable surface model with application to segmentation of volumetric images
inferred← citeshttps://doi.org/10.1109/tpami.2003.1195990openalex-snapshot
A general discrete contour model in two, three, and four dimensions for topology-adaptive multichannel segmentation
inferred← citeshttps://doi.org/10.1109/tvcg.2004.14openalex-snapshot
Multiresolution indexing of triangulated irregular networks
inferred← citeshttps://doi.org/10.1111/1467-8659.00457openalex-snapshot
Variable Resolution 4‐k Meshes: Concepts and Applications
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.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/2947668openalex-snapshot
Parallel Memory-Efficient Adaptive Mesh Refinement on Structured Triangular Meshes with Billions of Grid Cells
inferred← citeshttps://doi.org/10.1145/337680.337717openalex-snapshot
A unified approach for hierarchical adaptive tesselation of surfaces
inferred← citeshttps://doi.org/10.1145/997817.997888openalex-snapshot
Single-strip triangulation of manifolds with arbitrary topology
inferred← citeshttps://doi.org/10.1504/ijbidm.2017.10004158openalex-snapshot
An evaluation of four reordering algorithms to reduce the computational cost of the Jacobi-preconditioned Conjugate Gradient Method using high-precision arithmetic
inferred← citeshttps://doi.org/10.32657/10356/14962openalex-snapshot
Real-time procedural modeling of fracture of brittle materials in games
inferred← citeshttps://doi.org/10.5540/03.2018.006.01.0451openalex-snapshot
Uma avaliação da utilização de busca local com o método Reverse Cuthill-McKee
inferred← citeshttps://doi.org/10.59254/sbpo-2018-85401openalex-snapshot
An evaluation of heuristics for bandwidth and profile reductions applied to matrices ordered by a space-filling curve
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.