Yi-jen Chiang - Citegraph

Author Info

Name	Affiliation	Papers
YI-JEN CHIANG	Department of Applied Mathematics and Statistics, State University of New York, Stony Brook, NY 11794-3600, USA. yjc@ams.sunysb.edu. US	41
Collaborators	Citations	PageRank
42	503	38.21
Referers	Referees	References
850	588	598

Search Limit

100850

Publications (41 rows)

Collaborators (42 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Rods and Rings: Soft Subdivision Planner for R^3 x S^2.	0	0.34	2019
Soft subdivision motion planning for complex planar robots	0	0.34	2018
Key Time Steps Selection for Large-Scale Time-Varying Volume Datasets Using an Information-Theoretic Storyboard.	4	0.39	2018
Resolution-Exact Algorithms for Link Robots.	1	0.36	2014
On soft predicates in subdivision motion planning	6	0.51	2013
Scalable computation of distributions from large scale data sets	5	0.45	2012
Out-of-core simplification and crack-free LOD volume rendering for irregular grids	2	0.38	2010
Errata to “Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree (PTOT)”	0	0.34	2010
Isosurface extraction and view-dependent filtering from time-varying fields using Persistent Time-Octree (PTOT).	5	0.44	2009
Out-of-Core Progressive Lossless Compression and Selective Decompression of Large Triangle Meshes	2	0.35	2009
Out-of-core volume rendering for time-varying fields using a space-partitioning time (SPT) tree	6	0.51	2009
Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets	3	0.43	2007
Cost prediction for ray shooting in octrees	1	0.38	2006
Lossless geometry compression for steady-state and time-varying irregular grids	3	0.49	2006
Cost-driven octree construction schemes: an experimental study	11	0.60	2005
Optimized prediction for geometry compression of triangle meshes	5	0.43	2005
GEOMETRY COMPRESSION OF TETRAHEDRAL MESHES USING OPTIMIZED PREDICTION	5	0.42	2005
Simple and optimal output-sensitive construction of contour trees using monotone paths	44	1.50	2005
New Approximation Results for the Maximum Scatter TSP	1	0.36	2005
Multiple-description geometry compression for networked interactive 3D graphics.	7	0.53	2004
Out-of-Core Isosurface Extraction of Time-Varying Irregular Grids	1	0.38	2003
Progressive Simplification Of Tetrahedral Meshes Preserving All Isosurface Topologies	29	1.24	2003
Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions	6	0.96	2003
Cost prediction for ray shooting	5	0.78	2002
A unified infrastructure for parallel out-of-core isosurface extraction and volume rendering of unstructured grids	22	0.92	2001
External Memory View-Dependent Simplification	68	2.67	2000
On the Maximum Scatter Traveling Salesperson Problem	12	1.25	1999
Two-point Euclidean shortest path queries in the plane	26	1.25	1999
Interactive out-of-core isosurface extraction	74	5.63	1998
External memory techniques for isosurface extraction in scientific visualization	20	0.98	1998
On Minimum-Area Hulls	12	1.61	1998
Experiments on the practical I/O efficiency of geometric algorithms: distribution sweep versus plane sweep	10	1.71	1998
On the Maximum Scatter TSP (Extended Abstract)	1	0.37	1997
Optimal Shortest Path And Minimum-Link Path Queries Between Two Convex Polygons Inside A Simple Polygonal Obstacle	3	0.40	1997
I/O optimal isosurface extraction (extended abstract)	46	4.03	1997
On Minimum-Area Hulls (Extended Abstract)	0	0.34	1996
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps	24	1.38	1996
Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract)	0	0.34	1994
A UNIFIED APPROACH TO DYNAMIC POINT LOCATION, RAY SHOOTING, AND SHORTEST PATHS IN PLANAR MAPS	19	1.19	1993
Dynamization of the Trapezoid Method for Planar Point Location in Monotone Subdivisions	7	0.53	1992
Dynamization of the trapezoid method for planar point location (extended abstract)	7	0.72	1991