Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ben Houston

dblp:84/4665 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
3 papers
Computer animation and physical simulation · 83% Image and video processing · 11% Geometric modeling and processing · 6%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation
fluid simulation
0.222014
Vortical Inviscid Flows with Two-Way Solid-Fluid Coupling · IEEE Trans. Vis. Comput. Graph. 2014
A unified approach for modeling complex occlusions in fluid simulations · SIGGRAPH 2003
Computer animation and physical simulation › fluid simulation
solid-fluid coupling
0.212014
Vortical Inviscid Flows with Two-Way Solid-Fluid Coupling · IEEE Trans. Vis. Comput. Graph. 2014
Computer animation and physical simulation › fluid simulation › solid-fluid coupling
two-way coupling
0.212014
Vortical Inviscid Flows with Two-Way Solid-Fluid Coupling · IEEE Trans. Vis. Comput. Graph. 2014
Computer animation and physical simulation › fluid simulation
vortex methods
0.212014
Vortical Inviscid Flows with Two-Way Solid-Fluid Coupling · IEEE Trans. Vis. Comput. Graph. 2014
Geometric modeling and processing
implicit surface
0.112006
Hierarchical RLE level set: A compact and versatile deformable surface representation · ACM Trans. Graph. 2006
Image and video processing › mathematical imaging › partial differential equations for image processing
level set methods
0.112006
Hierarchical RLE level set: A compact and versatile deformable surface representation · ACM Trans. Graph. 2006
Image and video processing
occlusion handling
0.012003
A unified approach for modeling complex occlusions in fluid simulations · SIGGRAPH 2003

Methods — techniques the papers use, named apart from their topics

source panels · 0.2lagrangian vortex particles · 0.2inviscid flow simulation · 0.2run-length encoding · 0.1octree comparison · 0.1
YearPublicationVenuePosition
2014 Vortical Inviscid Flows with Two-Way Solid-Fluid Coupling
abstract
Vortex methods increasingly receive attention from the computer graphics community for simple and direct modeling of complex flow phenomena such as turbulence. The coupling between free-form solids, represented by arbitrary surface meshes, and fluids simulated with vortex methods, leads to visually rich simulations. In this paper, we introduce a novel approach for simulating the interaction between solids and inviscid fluids for high-quality simulations using Lagrangian vortex particles. The key aspect of our method is simulating the creation of vorticity at a solid's surface. While previous vortex simulators only focus on modeling the solid as a boundary for the fluid, our approach allows the accurate simulation of two processes of visual interest. The first is the introduction of surface vorticity in the main flow as turbulence (vortex shedding). The second is the motion of the solid induced by fluid forces. We also introduce to computer graphics the concept of source panels to model nonturbulent flow around objects. To the best of our knowledge, this is the first work on two-way coupling of 3D solids and fluids using Lagrangian vortex methods in computer graphics.
Mauricio Vines, Ben Houston, Jochen Lang 0001
IEEE Trans. Vis. Comput. Graph.2
2010 Tetrahedral Embedded Boundary Methods for Accurate and Flexible Adaptive Fluids
abstract
Abstract When simulating fluids, tetrahedral methods provide flexibility and ease of adaptivity that Cartesian grids find difficult to match. However, this approach has so far been limited by two conflicting requirements. First, accurate simulation requires quality Delaunay meshes and the use of circumcentric pressures. Second, meshes must align with potentially complex moving surfaces and boundaries, necessitating continuous remeshing. Unfortunately, sacrificing mesh quality in favour of speed yields inaccurate velocities and simulation artifacts. We describe how to eliminate the boundary‐matching constraint by adapting recent embedded boundary techniques to tetrahedra, so that neither air nor solid boundaries need to align with mesh geometry. This enables the use of high quality, arbitrarily graded, non‐conforming Delaunay meshes, which are simpler and faster to generate. Temporal coherence can also be exploited by reusing meshes over adjacent timesteps to further reduce meshing costs. Lastly, our free surface boundary condition eliminates the spurious currents that previous methods exhibited for slow or static scenarios. We provide several examples demonstrating that our efficient tetrahedral embedded boundary method can substantially increase the flexibility and accuracy of adaptive Eulerian fluid simulation.
Christopher Batty, Stefan Xenos, Ben Houston
Comput. Graph. Forum3
2006 Hierarchical RLE level set: A compact and versatile deformable surface representation
abstract
This article introduces the Hierarchical Run-Length Encoded (H-RLE) Level Set data structure. This novel data structure combines the best features of the DT-Grid (of Nielsen and Museth [2004]) and the RLE Sparse Level Set (of Houston et al. [2004]) to provide both optimal efficiency and extreme versatility. In brief, the H-RLE level set employs an RLE in a dimensionally recursive fashion. The RLE scheme allows the compact storage of sequential nonnarrowband regions while the dimensionally recursive encoding along each axis efficiently compacts nonnarrowband planes and volumes. Consequently, this new structure can store and process level sets with effective voxel resolutions exceeding 5000 × 3000 × 3000 (45 billion voxels) on commodity PCs with only 1 GB of memory. This article, besides introducing the H-RLE level set data structure and its efficient core algorithms, also describes numerous applications that have benefited from our use of this structure: our unified implicit object representation, efficient and robust mesh to level set conversion, rapid ray tracing, level set metamorphosis, collision detection, and fully sparse fluid simulation (including RLE vector and matrix representations.) Our comparisons of the popular octree level set and Peng level set structures to the H-RLE level set indicate that the latter is superior in both narrowband sequential access speed and overall memory usage.
Ben Houston, Michael Bang Nielsen, Christopher Batty, Ola Nilsson, Ken Museth
ACM Trans. Graph.1
2003 A unified approach for modeling complex occlusions in fluid simulations
abstract
No abstract available.
Ben Houston, Chris Bond, Mark Wiebe
SIGGRAPH1