Single-strips for fast interactive rendering

No abstract is available for this paper.

• Publication year

  2006

• Venue

  The Visual Computer

• Publication date

  2006-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00371-006-0018-2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Quadrilateral and tetrahedral mesh stripification using 2-factor partitioning of the dual graph

  2005cited by this paper
• Hierarchyless Simplification, Stripification and Compression of Triangulated Two‐Manifolds

  2005cited by this paper
• Cache-oblivious mesh layouts

  2005cited by this paper
• Constrained strip generation and management for efficient interactive 3D rendering

  2005cited by this paper
• Variational shape approximation

  2004cited by this paper
• Single‐Strip Triangulation of Manifolds with Arbitrary Topology

  2004influential reference
• Making papercraft toys from meshes using strip-based approximate unfolding

  2004cited by this paper
• Multi-path algorithm for triangle strips

  2004cited by this paper
• Controllable single-strip generation for triangulated surfaces

  2004influential reference
• DStrips: dynamic triangle strips for real-time mesh simplification and rendering

  2003cited by this paper
• QuadTIN: quadtree based triangulated irregular networks

  2002cited by this paper
• Multiresolution Triangle Strips

  2001cited by this paper
• Topology matching for fully automatic similarity estimation of 3D shapes

  2001cited by this paper
• Tunneling for Triangle Strips in Continuous Level--of--Detail Meshes

  2001cited by this paper
• Hierarchical face clustering on polygonal surfaces

  2001cited by this paper
• Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes

  2001cited by this paper
• Optimization of mesh locality for transparent vertex caching

  1999influential reference
• Computing Minimum-Weight Perfect Matchings

  1999cited by this paper
• FAST AND SIMPLE TRIANGLE STRIP GENERATION

  1999cited by this paper
• Hierarchical generalized triangle strips

  1999cited by this paper
• Fast and effective stripification of polygonal surface models

  1999cited by this paper
• Skip Strips: maintaining triangle strips for view-dependent rendering

  1999cited by this paper
• Approximating Maximum Leaf Spanning Trees in Almost Linear Time

  1998cited by this paper
• View-dependent simplification of arbitrary polygonal environments

  1997cited by this paper
• Optimized geometry compression for real-time rendering

  1997cited by this paper
• Model simplification using vertex-clustering

  1997cited by this paper
• Hamiltonian triangulations for fast rendering

  1996cited by this paper
• Optimizing triangle strips for fast rendering

  1996cited by this paper
• Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete

  1996cited by this paper
• Approximation Algorithms for Connected Dominating Sets

  1996cited by this paper
• Time/space tradeoffs for polygon mesh rendering

  1996cited by this paper
• Geometry compression

  1995cited by this paper
• Skip lists: a probabilistic alternative to balanced trees

  1989cited by this paper
• Die Theorie der regulären graphs

  1891cited by this paper

• A Simple 2-Approximation for Maximum-Leaf Spanning Tree

  2023cites this paper
• Mesh Clustering and Reordering Based on Normal Locality for Efficient Rendering

  2022cites this paper
• Optimizing redundant-data clustering for interactive walkthrough applications

  2014cites this paper
• Single-Seek Data Layout for Walkthrough Applications

  2013cites this paper
• Explicit memory management for mesh traversal

  2013cites this paper
• Advanced Engineering Platform for Industrial Development

  2012cites this paper
• Data management for SSDs for large-scale interactive graphics applications

  2011cites this paper
• Adaptive Keyframing Animation on the GPU Using Triangle Strips

  2010cites this paper
• Binary Mesh Partitioning for Cache-Efficient Visualization

  2010cites this paper
• A novel page-based data structure for interactive walkthroughs

  2009cites this paper
• Rendering continuous level-of-detail meshes by Masking Strips

  2009cites this paper
• Using graph algorithms for geometry processing on surfaces

  2009cites this paper
• Dynamic Mesh Refinement on GPU using Geometry Shaders

  2008cites this paper
• Technical Section: Optimizing the management of continuous level of detail models on GPU

  2008cites this paper
• Max Leaf Spanning Tree

  2008cites this paper
• Fast triangle reordering for vertex locality and reduced overdraw

  2007cites this paper
• Random-Accessible Compressed Triangle Meshes

  2007cites this paper
• Geometry engine optimization: cache friendly compressed representation of geometry

  2007cites this paper
• Partitioning Meshes into Strips using the Enhanced Tunnelling Algorithm (ETA)

  2006cites this paper
• Syllabus

  1959cites this paper