Yi-Jen Chiang

Orcid: 0000-0001-7822-6200

According to our database1, Yi-Jen Chiang authored at least 45 papers between 1991 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Streaming Approach to In Situ Selection of Key Time Steps for Time-Varying Volume Data.
Comput. Graph. Forum, 2022

2021
Soft subdivision motion planning for complex planar robots.
Comput. Geom., 2021

2019
Efficient Local Statistical Analysis via Point-Wise Histograms in Tetrahedral Meshes and Curvilinear Grids.
IEEE Trans. Vis. Comput. Graph., 2019

Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Key Time Steps Selection for Large-Scale Time-Varying Volume Datasets Using an Information-Theoretic Storyboard.
Comput. Graph. Forum, 2018

2015
On soft predicates in subdivision motion planning.
Comput. Geom., 2015

2014
Resolution-Exact Algorithms for Link Robots.
Proceedings of the Algorithmic Foundations of Robotics XI, 2014

2012
Scalable computation of distributions from large scale data sets.
Proceedings of the IEEE Symposium on Large Data Analysis and Visualization, 2012

2010
Errata to "Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree (PTOT)".
IEEE Trans. Vis. Comput. Graph., 2010

Out-of-Core Simplification and Crack-Free LOD Volume Rendering for Irregular Grids.
Comput. Graph. Forum, 2010

2009
Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree(PTOT).
IEEE Trans. Vis. Comput. Graph., 2009

Out-of-Core Progressive Lossless Compression and Selective Decompression of Large Triangle Meshes.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

Out-of-core volume rendering for time-varying fields using a space-partitioning time (SPT) tree.
Proceedings of the IEEE Pacific Visualization Symposium PacificVis 2009, 2009

2007
Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets.
IEEE Trans. Commun., 2007

2006
Cost prediction for ray shooting in octrees.
Comput. Geom., 2006

Lossless Geometry Compression for Steady-State and Time-Varying Irregular Grids.
Proceedings of the 8th Joint Eurographics - IEEE VGTC Symposium on Visualization, 2006

2005
Simple and optimal output-sensitive construction of contour trees using monotone paths.
Comput. Geom., 2005

Cost-driven octree construction schemes: an experimental study.
Comput. Geom., 2005

New Approximation Results for the Maximum Scatter TSP.
Algorithmica, 2005

Geometry compression of tetrahedral meshes using optimized prediction.
Proceedings of the 13th European Signal Processing Conference, 2005

Optimized Prediction for Geometry Compression of Triangle Meshes.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004
Multiple-description geometry compression for networked interactive 3D graphics.
Proceedings of the Third International Conference on Image and Graphics, 2004

2003
Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies.
Comput. Graph. Forum, 2003

Out-of-Core Isosurface Extraction of Time-Varying Irregular Grids.
Proceedings of the 14th IEEE Visualization Conference, 2003

Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002
Cost prediction for ray shooting.
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001
A unified infrastructure for parallel out-of-core isosurface extraction and volume rendering of unstructured grids.
Proceedings of the IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics, 2001

2000
External Memory View-Dependent Simplification.
Comput. Graph. Forum, 2000

1999
On the Maximum Scatter Traveling Salesperson Problem.
SIAM J. Comput., 1999

Two-Point Euclidean Shortest Path Queries in the Plane.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep.
Comput. Geom., 1998

On Minimum-Area Hulls.
Algorithmica, 1998

Interactive out-of-core isosurface extraction.
Proceedings of the 9th IEEE Visualization Conference, 1998

External memory techniques for isosurface extraction in scientific visualization.
Proceedings of the External Memory Algorithms, 1998

1997
Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle.
Int. J. Comput. Geom. Appl., 1997

I/O optimal isosurface extraction (extended abstract).
Proceedings of the 8th IEEE Visualization Conference, 1997

On the Maximum Scatter TSP (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps.
SIAM J. Comput., 1996

On Minimum-Area Hulls (Extended Abstract).
Proceedings of the Algorithms, 1996

1995
Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

External-Memory Graph Algorithms.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994
Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract).
Proceedings of the Algorithms, 1994

1992
Dynamic algorithms in computational geometry.
Proc. IEEE, 1992

Dynamization of the trapezoid method for planar point location in monotone subdivisions.
Int. J. Comput. Geom. Appl., 1992

1991
Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991


  Loading...