Jun Luo

Affiliations:
  • Chinese Academy of Sciences, Shenzhen Institutes of Advanced Technology, Shenzhen, China


According to our database1, Jun Luo authored at least 36 papers between 2005 and 2015.

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

2015
Expected computations on color spanning sets.
J. Comb. Optim., 2015

2014
Voronoi diagram with visual restriction.
Theor. Comput. Sci., 2014

On Some Proximity Problems of Colored Sets.
J. Comput. Sci. Technol., 2014

2013
Preface.
Theor. Comput. Sci., 2013

Largest area convex hull of imprecise data based on axis-aligned squares.
J. Comb. Optim., 2013

On some geometric problems of color-spanning sets.
J. Comb. Optim., 2013

Tight Approximation Bounds for Connectivity with a Color-Spanning Set.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

On Some Proximity Problems of Colored Sets.
Proceedings of the Combinatorial Optimization and Applications, 2013

Expected Computations on Color Spanning Sets.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Processing aggregated data: the location of clusters in health data.
GeoInformatica, 2012

2011
Continuous-Time Moving Network Voronoi Diagram.
Trans. Comput. Sci., 2011

Connect the dot: Computing feed-links for network extension.
J. Spatial Inf. Sci., 2011

Detecting Commuting Patterns by Clustering Subtrajectories.
Int. J. Comput. Geom. Appl., 2011

Geodesic Disks and Clustering in a Simple Polygon.
Int. J. Comput. Geom. Appl., 2011

Finding long and similar parts of trajectories.
Comput. Geom., 2011

Hide-and-Seek: Algorithms for Polygon Walk Problems.
Proceedings of the Theory and Applications of Models of Computation, 2011

A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Fréchet Distance.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

On Some Geometric Problems of Color-Spanning Sets.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Finding the Most Relevant Fragments in Networks.
J. Graph Algorithms Appl., 2010

Mining Trajectory Corridors Using Fréchet Distance and Meshing Grids.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2010

Moving Network Voronoi Diagram.
Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

NP-Completeness of Spreading Colored Points.
Proceedings of the Combinatorial Optimization and Applications, 2010

Fréchet-Distance on Road Networks.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

Point Location in the Continuous-Time Moving Network.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Planar bichromatic minimum spanning trees.
J. Discrete Algorithms, 2009

Stabbing balls and simplifying proteins.
Int. J. Bioinform. Res. Appl., 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Detecting Hotspots in Geographic Networks.
Proceedings of the Advances in GIScience, 2009

2008
Clusters in Aggregated Health Data.
Proceedings of the Headway in Spatial Data Handling, 2008

Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Computing Simple Paths on Points in Simple Polygons.
Proceedings of the Computational Geometry and Graph Theory, 2007

The definition and computation of trajectory and subtrajectory similarity.
Proceedings of the 15th ACM International Symposium on Geographic Information Systems, 2007

2006
Cutting out Polygons with Lines and Rays.
Int. J. Comput. Geom. Appl., 2006

Proximity problems on line segments spanned by points.
Comput. Geom., 2006

2005
Cutting Out Polygons.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005


  Loading...