Xuehou TAN


Characterizing Link-2 LR-Visibility Polygons and Related Problems
Xuehou TAN Bo JIANG 
Publication:   
Publication Date: 2019/02/01
Vol. E102-A  No. 2  pp. 423-429
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
computational geometryvisibilitynon-redundant componentslink-k visibilitypolygon search problem
 Summary | Full Text:PDF

The Touring Polygons Problem Revisited
Xuehou TAN Bo JIANG 
Publication:   
Publication Date: 2018/05/01
Vol. E101-A  No. 5  pp. 772-777
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
shortest pathtouring polygons problemlast step shortest path mapconvex polygons
 Summary | Full Text:PDF

Competitive Strategies for Evacuating from an Unknown Affected Area
Qi WEI Xuehou TAN Bo JIANG 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/10/01
Vol. E99-D  No. 10  pp. 2585-2590
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
evacuation problemcomputational geometrypath planningconvex regioncompetitive ratio
 Summary | Full Text:PDF

A Note on the Edge Guard Problem for Spiral Polygons
Xuehou TAN 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/02/25
Vol. E83-D  No. 2  pp. 283-284
Type of Manuscript:  LETTER
Category: Theory/Models of Computation
Keyword: 
computational geometryart gallery problemedge guardsspiral polygons
 Summary | Full Text:PDF

Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees
Xuehou TAN Tomio HIRATA Yasuyoshi INAGAKI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1994/04/25
Vol. E77-A  No. 4  pp. 601-607
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
computational geometrypersistent data structurespersistent binary-binary search treesray-shooting
 Summary | Full Text:PDF