EDBT 2026 Demo / reviewers in the wild / expert
Jeffrey Mahovsky
dblp:37/1231
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
1 paper |
Rendering · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering › parallel rendering › distributed rendering
cluster rendering |
0.0 | 1 | 2003 | An Architecture for Java-Based Real-Time Distributed Visualization · IEEE Trans. Vis. Comput. Graph. 2003 |
Rendering › parallel rendering
distributed rendering |
0.0 | 1 | 2003 | An Architecture for Java-Based Real-Time Distributed Visualization · IEEE Trans. Vis. Comput. Graph. 2003 |
High-performance computing › scientific visualization
remote visualization |
0.0 | 1 | 2003 | An Architecture for Java-Based Real-Time Distributed Visualization · IEEE Trans. Vis. Comput. Graph. 2003 |
Methods — techniques the papers use, named apart from their topics
volume rendering · 0.1ray tracing · 0.1fractal rendering · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Memory-Conserving Bounding Volume Hierarchies with Coherent RaytracingabstractAbstract Bounding volume hierarchies (BVHs) are a popular method for speeding up raytracing, but they can consume a large amount of memory for complex scenes. We investigate a hierarchical scheme for encoding BVHs that reduces the BVH storage requirements by 63%–75%. The computational overhead of the scheme can be reduced to negligible levels by shooting bundles of rays through the BVH (coherent raytracing). This gives the speed of a coherency‐based raytracer combined with substantial memory savings. Jeffrey Mahovsky, Brian Wyvill |
Comput. Graph. Forum | 1 |
| 2003 | An Architecture for Java-Based Real-Time Distributed VisualizationabstractIn this paper, we present a Java-based software architecture for real-time visualization that utilizes a cluster of conventional PCs to generate high-quality interactive graphics. Normally, a large multiprocessor computer would be needed for interactive visualization tasks requiring more processing power than a single PC can provide. By using clusters of PCs, enormous cost savings can be realized, and proprietary "high-end" hardware is no longer necessary for these tasks. Our architecture minimizes the amount of synchronization needed between PCs, resulting in excellent scalability. It provides a modular framework that can accommodate a wide variety of rendering algorithms and data formats, provided that the rendering algorithms can generate pixels individually and the data is duplicated on each PC. Demonstration modules that implement ray tracing, fractal rendering, and volume rendering algorithms were developed to evaluate the architecture. Results are encouraging-using 15 PCs connected to a standard 100 Megabit/s Ethernet network, the system can interactively render simple to moderately complex data sets at modest resolution. Excellent scalability is achieved; however, our tests were limited to a cluster of 15 PCs. Results also demonstrate that Java is a viable platform for real-time distributed visualization. Jeffrey Mahovsky, Luigi Benedicenti |
IEEE Trans. Vis. Comput. Graph. | 1 |