Yi-jen Chiang, Xiang Lu, Xiang Lu
Isosurface extraction is one of the most powerful techniques in the investigation of volume datasets in scientific visualization. The contour tree is a fundamental data structure for fast isosurface...
Alphabet partitioning techniques for semi-adaptive Huffman coding of large alphabets (2008)
Dan Chen, Dan Chen, Yi-jen Chiang, Yi-jen Chiang, Nasir Memon, Nasir Memon, ...
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix coding for each...
Dan Chen, Yi-jen Chiang, Nasir Memon, Xiaolin Wu
Abstract — In this paper we investigate the problem of lossless geometry compression of irregular-grid volume data represented as a tetrahedral mesh. We propose a novel lossless compression...
Lossless Geometry Compression for Steady-State and Time-Varying Irregular Grids † (2008)
Thomas Ertl, Ken Joy, Beatriz Santos (editors, Dan Chen, Yi-jen Chiang, Nasir Memon, ...
In this paper we investigate the problem of lossless geometry compression of irregular-grid volume data represented as a tetrahedral mesh. We propose a novel lossless compression technique that...
On Minimum-Area Hulls (Extended Abstract) (2008)
Esther M. Arkin, Yi-jen Chiang, Martin Held, Steven S. Skiena, Tae-cheon Yang
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to star-shaped and monotone hulls. Specifically, we consider the minimum-area star-shaped hull problem:...
Alphabet Partitioning Techniques for (2008)
Dan Chen, Yi-jen Chiang, Nasir Memon, Xiaolin Wu
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix coding for each...
DOI: 10.1007/s00453-004-1124-z (2008)
Algorithmica Of Of, Yi-jen Chiang
We consider the following maximum scatter traveling salesperson problem (TSP): given an edgeweighted complete graph (S, E), find a Hamiltonian path or cycle such that the length of a shortest edge is...
Yi-Jen Chiang, Computational Geometry, Graph Problems
As most important applications today are large-scale in nature, high-performance methods are becoming indispensable. Two promising computational paradigms for large-scale applications are dynamic and...
Geometry Compression Of Tetrahedral Meshes Using Optimized (2005)
Prediction Dan Chen, Dan Chen, Yi-jen Chiang, Nasir Memon, Xiaolin Wu
In this paper we propose a novel geometry compression technique for volumetric datasets represented as tetrahedral meshes. We focus on a commonly used technique for predicting vertex geometries via a...
Computational Geometry 34 (2006) 159--181 (2005)
Www Elsevier Com, Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-jen Chiang
The ray shooting problem arises in many different contexts and is a bottleneck of ray tracing in computer graphics. Unfortunately, theoretical solutions to the problem are not very practical, while...
Lossless geometry compression for steady-state and time-varying irregular grids (2005)
Tetrahedral Meshes, Dan Chen, Yi-jen Chiang, Nasir Memon, Xiaolin Wu
In recent years, new challenges for scientific visualization have emerged as the size of data generated from simulations has grown exponentially. The emerging demand for efficiently storing,...
Simple and Optimal Output-Sensitive Construction of Contour Trees Using Monotone Paths (2004)
Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
Contour trees are used when high-dimensional data are preprocessed for e#cient extraction of isocontours for the purpose of visualization. So far, e#cient algorithms for contour trees are based on...
Simple and optimal output-sensitive construction of contour trees using monotone paths (2004)
Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
Contour trees are used when high-dimensional data are preprocessed for efficient extraction of isocontours for the purpose of visualization. So far, efficient algorithms for contour trees are based...
Www Elsevier Com, Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-jen Chiang
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-realistic images in...
Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids (2003)
In this paper, we propose a novel out-of-core isosurface extraction technique for large time-varying fields over irregular grids. We employ our meta-cell technique to explore the spatial coherence of...
Dan Chen, Yi-Jen Chiang, Nasir Memon, Xiaolin Wu
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable pre x coding for each...
Dan Chen, Yi-jen Chiang, Nasir Memon, Xiaolin Wu
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix coding for each...
Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies (2003)
In this paper, we propose a novel technique for constructing multiple levels of a tetrahedral volume dataset while preserving the topologies of all isosurfaces embedded in the data. Our...
Dan Chen, Yi-jen Chiang, Nasir Memon, Xiaolin Wu
Practical applications that employ entropy coding for large alphabets of-ten partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix coding for each...
Out-of-core algorithms for scientific visualization and computer graphics (2002)
Cláudio Silva, Yi-jen Chiang, Wagner Corrêa, Jihad El-sana, Peter Lindstrom
Recently, several external memory techniques have been developed for a wide variety of graphics and visualization problems, including surface simplification, volume rendering, isosurface generation,...
Cost prediction for ray shooting (2002)
Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-jen Chiang
The ray shooting problem arises in many different contexts. For example, solving it efficiently would remove a bottleneck when images are ray-traced in computer graphics. Unfortunately, theoretical...
EUROGRAPHICS '2000 / M. Gross and F.R.A. Hopgood (2000)
Guest Editors Volume, Jihad El-sana, Yi-jen Chiang
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use a new spanned...
External Memory Techniques for Isosurface Extraction in Scientific Visualization (1999)
Scienti C Visualization, Yi-jen Chiang, Claudio T. Silva
Isosurface extraction is one of the most effective and powerful techniques for the investigation of volume datasets in scientific visualization. Previous isosurface techniques are all main-memory...
External Memory Techniques for Isosurface Extraction in Scientific Visualization (Abstract) (1999)
Yi-Jen Chiang, Cl'audio T. Silva
Isosurface extraction is one of the most effective and powerful techniques for the investigation of volume datasets in scientific visualization. Previous isosurface techniques are all main-memory...
External Memory Techniques for Isosurface Extraction in Scientific Visualization (1999)
Yi-jen Chiang, Cláudio T. Silva, Cl'audio T. Silva
. Isosurface extraction is one of the most effective and powerful techniques for the investigation of volume datasets in scientific visualization. Previous isosurface techniques are all main-memory...
Yi-Jen Chiang, Cláudio T. Silva, Cl'audio T. Silva
For large scientific visualization applications, it is often impossible to hold the entire datasets in main memory, even on supercomputers. Previously, we proposed the I/O-filter technique, which is...
Interactive Out-Of-Core Isosurface Extraction (1998)
Yi-Jen Chiang, Claudio T. Silva, William J. Schroeder
In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the...
I/O Optimal Isosurface Extraction (1997)
Yi-Jen Chiang, Claudio T. Silva
In this paper we give I/O-optimal techniques for the extraction of isosurfaces from volumetric data, by a novel application of the I/Ooptimal interval tree of Arge and Vitter. The main idea is to...
I/O Optimal Isosurface Extraction (Extended Abstract) (1997)
Yi-Jen Chiang, Cláudio T. Silva
) Yi-Jen Chiang Claudio T. Silva y State University of New York at Stony Brook Abstract In this paper we give I/O-optimal techniques for the extraction of isosurfaces from volumetric data, by a novel...
On the Maximum Scatter TSP (1997)
Esther M. Arkin, Yi-Jen Chiang, Steven S. Skiena, Tae-Cheon Yang
. We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour or path. This "maximum scatter" TSP is...
Geometric Algorithms for Conflict Detection/Resolution in Air Traffic Management (1997)
Appeared In, Yi-jen Chiang, James T. Klosowski, Changkil Lee
We consider the problems of conflict detection and resolution in air traffic management (ATM) from the perspective of computational geometry and give algorithms for solving these problems...
We present an extensive experimental study comparing the performance of four algorithms for the following orthogonal segment intersection problem: given a set of horizontal and vertical line segments...
I/O Optimal Isosurface Extraction in Scientific Visualization (1997)
Yi-Jen Chiang, Cláudio T. Silva
) Yi-Jen Chiang y Claudio T. Silva z Isosurface extraction represents one of the most effective and powerful techniques for the investigation of volume datasets in Scientific Visualization. It has...
I/O Optimal Isosurface Extraction (1997)
Yi-Jen Chiang, Cláudio T. Silva
In this paper we give I/O-optimal techniques for the extraction of isosurfaces from volumetric data, by an application of the I/O-optimal interval tree of Arge and Vitter. The main idea is to...
On the Maximum Scatter TSP (Extended Abstract) (1997)
E. M. Arkin, Yi-Jen Chiang, Esther M. Arkin, Steven S. Skiena, Tae-cheon Yang
) Esther M. Arkin y Yi-Jen Chiang z Joseph S. B. Mitchell x Steven S. Skiena -- Tae-Cheon Yang k To appear in Proc. ACM-SIAM Symposium on Discrete Algorithms (1997) Abstract We study the problem of...
Geometric Algorithms for Conflict Detection/Resolution in Air Traffic Management (1997)
Yi-jen Chiang, James T. Klosowski, Changkil Lee
We consider the problems of conflict detection and resolution in air traffic management (ATM) from the perspective of computational geometry and give algorithms for solving these problems...
Geometric algorithms for conflict detection/resolution in air traffic management (1997)
Yi-jen Chiang, James T. Klosowski, Changkil Lee
We consider the problems of conflict detection and resolution in air traffic management (ATM) from the perspective of computational geometry and give algorithms for solving these problems...
On the Maximum Scatter TSP (1996)
Esther M. Arkin, Yi-Jen Chiang, Steven S. Skiena, Tae-cheon Yang
We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour or path. This "maximum scatter" TSP is...
Available in film copy from University Microfilms International.
We present an extensive experimental study comparing the performance of four algorithms for the following orthogonal segment intersection problem: given a set of horizontal and vertical line segments...
Dynamic and I/O-Efficient Algorithms for Computational Geometry and . . . (1995)
Yi-Jen Chiang, Computational Geometry, Graph Problems
As most important applications today are large-scale in nature, high-performance methods are becoming indispensable. Two promising computational paradigms for large-scale applications are dynamic and...
External-Memory Graph Algorithms (1995)
Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, ...
We present a collection of new techniques for designing and analyzing efficient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of...
External-Memory Graph Algorithms (1995)
Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, ...
We present a collection of new techniques for designing and analyzing efficient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of...
Yi-jen Chiang, Yi-jen Chiang, Roberto Tamassia, Roberto Tamassia
We present efficient algorithms for shortest-path and minimum-link-path queries between two convex polygons inside a simple polygon P , which acts as an obstacle to be avoided. Let n be the number of...
Yi-jen Chiang, Roberto Tamassia
We present efficient algorithms for shortest-path and minimum-link-path queries between two convex polygons inside a simple polygon P , which acts as an obstacle to be avoided. Let n be the number of...
Yi-jen Chiang, Roberto Tamassia
) Yi-Jen Chiang and Roberto Tamassia Department of Computer Science Brown University Providence, R. I. 02912--1910 fyjc,rtg@cs.brown.edu Abstract. We present efficient algorithms for shortest-path...
A Unified Approach To Dynamic Point Location, Ray Shooting, And Shortest Paths In Planar Maps (1993)
Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia
. We describe a new technique for dynamically maintaining the trapezoidal decomposition of a connected planar map M with n vertices, and apply it to the development of a unified dynamic data...
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps (1993)
Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia
. We describe a new technique for dynamically maintaining the trapezoidal decomposition of a connected planar map M with n vertices, and apply it to the development of a unified dynamic data...
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps (1992)
Yi-jen Chiang, Yi-jen Chiang, Franco P. Preparata, Franco P. Preparata, Roberto Tamassia
We describe a new technique for dynamically maintaining the trapezoidal decomposition of a planar map M with n vertices, and apply it to the development of a unified dynamic data structure that...
Dynamization of the Trapezoid Method for Planar Point Location in Monotone Subdivisions (1992)
Yi-jen Chiang, Yi-jen Chiang, Roberto Tamassia, Roberto Tamassia
We present a fully dynamic data structure for point location in a monotone subdivision, based on the trapezoid method. The operations supported are insertion and deletion of vertices and edges, and...
Dynamic Algorithms in Computational Geometry (1992)
Yi-jen Chiang, Roberto Tamassia
Research on dynamic algorithms for geometric problems has received increasing attention in the last years, and is motivated by many important applications in circuit layout, computer graphics, and...
Dynamization of the Trapezoid Method for Planar Point Location in Monotone Subdivisions (1992)
Yi-jen Chiang, Roberto Tamassia
We present a fully dynamic data structure for point location in a monotone subdivision, based on the trapezoid method. The operations supported are insertion and deletion of vertices and edges, and...