Tan Xuehou 譚学厚

… Alternative Names

TAN Xuehou 譚学厚

譚学厚タンガクコウ

Less

Researcher Number	50256179
Affiliation (Current)	2022: 東海大学, 情報理工学部, 教授
Affiliation (based on the past Project Information) *help	2015 – 2021: 東海大学, 情報理工学部, 教授 2011 – 2013: 東海大学, 情報理工学部, 教授 2007: Tokai University, School of High-technology for Human Welfare, Professor 2005 – 2007: 東海大学, 開発工学部, 助教授 1996: 東海大学, 開発工学部, 講師 1994: 東海大学, 開発工学部, 助手
Review Section/Research Field	Principal Investigator 計算機科学 / Fundamental theory of informatics / Theory of informatics / Basic Section 60010:Theory of informatics-related
Keywords	Principal Investigator アルゴリズム / 警備員巡回路問題 / 計算幾何 / 計算量 / 時間計算量 / オンラインアルゴリズム / 競合比 / グラフの膨張因子 / データ構造 / 警備員経路 … More / サファリ経路 / 分割統治法 / 最短巡回路 / 動物園巡回路問題 / 補正 / 三角形分割 / 展開 / 幾何学的捜索問題 / 可視性 / ツーガイド問題 / LR-可視的多角形 / グラフアルゴリズム / 単純経路 / 経路探索問題 / 幾何学的捜索 / グラフ的手法 / 計算幾何学 / 多角形捜索問題 / チェーンガード / 捜索アルゴリズム / 可視イベント / ツーガード問題 / 近似アルゴリズム / リンク距離 / algorithms / computational geometry / watchman route problem / polygon search problem / on-line algorithms / competitive factor / chain guards / complexity / 巡回セールスマン問題 / 順序性 / 最短路問題 / 射線巡回路問題 / 多項式時間アルゴリズム / 平面グラフの膨張因子 / 平面的ツーセンター問題 / Fermat-Weberセンター / アルゴリズム論 / グラフ膨張因子 / ツーセンター問題 Less

Research Projects
(6 results)
Research Products
(51 results)

ドローネ三角網による平面的グラフの膨張因子とツーセンター問題の基礎研究Principal Investigator
- Principal Investigator
  
  譚学厚
- Project Period (FY)
  2020 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Tokai University
A study on the algorithms for touring a sequnec of geometric objectsPrincipal Investigator
- Principal Investigator
  
  Tan Xuehou
- Project Period (FY)
  2015 – 2019
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  Tokai University
A graph-based approach to the visibility-based pursuit-evasion problemPrincipal Investigator
- Principal Investigator
  
  TAN Xuehou
- Project Period (FY)
  2011 – 2013
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Tokai University
A study on the algorithms for searching a static or moving target in a polygonal regionPrincipal Investigator
- Principal Investigator
  
  TAN Xuehou
- Project Period (FY)
  2005 – 2007
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Tokai University
最短巡回路問題に関する最適なアルゴリズムの研究Principal Investigator
- Principal Investigator
  
  譚学厚
- Project Period (FY)
  1996
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  Tokai University
最適経路問題に関するアルゴリズムの開発とその応用Principal Investigator
- Principal Investigator
  
  譚学厚
- Project Period (FY)
  1994
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  Tokai University

[Book] Frontiners in Algorithmics and Algorithmic Aspects in Information and Management2013
- Author(s)
  M. Fellows, X. Tan and B. Zhu
- Total Pages
  361
- Publisher
  Springer
- Data Source
  KAKENHI-PROJECT-23500024
[Book] Frontiers in Algorithmics and Algorithmic Aspects in Information and Management2013
- Author(s)
  Michael Fellows, Xuehu Tan, Binhai Zhu
- Total Pages
  361
- Publisher
  Springer
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Simple Proof of the Lower Bound on the Average Distance from the Fermat-Weber Center of a Convex Body2022
- Author(s)
  Xuehou Tan
- Journal Title
  
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  
  Volume: E105-A Issue: 5 Pages: 853-857
- DOI
  10.1587/transfun.2021eap1103
  10.1587/transfun.2021EAP1103
- NAID
  130008116405
- ISSN
  0916-8508, 1745-1337
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11683
[Journal Article] The touring rays and related problems2021
- Author(s)
  Xuehou Tan
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 866 Pages: 43-55
- DOI
  10.1016/j.tcs.2021.03.005
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11683
[Journal Article] On the upper bound on the average distance from the Fermat-Weber center of a convex body2021
- Author(s)
  Xuehou Tan, Bo Jiang
- Journal Title
  
  Computational Geometry: Theory and Applications
  
  Volume: 97
- DOI
  10.1016/j.comgeo.2021.101769
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11683
[Journal Article] Polynomial-time algorithms for the touring rays and related problems2020
- Author(s)
  Xuehou Tan
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 12290 Pages: 1-12
- DOI
  10.1007/978-3-030-57602-8_1
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11683
[Journal Article] Improved stretch factor of Delaunary triangulations of points in convex position2019
- Author(s)
  Xuehou Tan, Ch. Sakthip, Bo Jiang
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 11949 Pages: 473-484
- DOI
  10.1007/978-3-030-36412-0_38
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] Characterizing Link-2 LR-Visibility Polygons and Related Problems2019
- Author(s)
  Xuehou Tan and Bo Jiang
- Journal Title
  
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  
  Volume: E102-A Issue: 2 Pages: 423-429
- DOI
  10.1587/transfun.e102.a.423
  10.1587/transfun.E102.A.423
- NAID
  130007587406
- ISSN
  0916-8508, 1745-1337
- Language
  English
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] Computing simple paths from given points inside a polygon2019
- Author(s)
  Xuehou Tan and Bo Jiang
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 257 Pages: 67-76
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] The Touring Polygons Problem Revisited2018
- Author(s)
  Xuehou Tan and Bo Jiang
- Journal Title
  
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  
  Volume: E101-A Issue: 5 Pages: 772-777
- DOI
  10.1587/transfun.e101.a.772
  10.1587/transfun.E101.A.772
- NAID
  130006729465
- ISSN
  0916-8508, 1745-1337
- Language
  English
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] An improved algorithm for computing a shortest watchman route for lines2018
- Author(s)
  Xuehou Tan and Bo Jiang
- Journal Title
  
  Information Processing Letters
  
  Volume: 131 Pages: 51-54
- DOI
  10.1016/j.ipl.2017.11.011
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] The capture time of a planar graph2018
- Author(s)
  P. Pisantechakool and Xuehou Tan,
- Journal Title
  
  Journal of Combinatorial Optimization
  
  Volume: 36 Pages: 1103-1117
- DOI
  10.1007/s10878-017-0173-6
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] Efficient algorithms for touring a sequence of convex polygons and related problems2017
- Author(s)
  Xuehou Tan and Bo Jiang
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 10185 Pages: 614-627
- Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] Simple O(n log^2 n) algorithms for the planar 2-center problem2017
- Author(s)
  Xuehou Tan and Bo Jiang
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 10392 Pages: 481-491
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] On the conjecture of the smallest 3-cop-win planar graph2017
- Author(s)
  Photchchara Pisantechakool and Xuehou Tan
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 10185 Pages: 499-514
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] Competitive Strategies for Evacuating from an Unknown Affected Area2016
- Author(s)
  Qi Wei, Xuehou Tan and Bo Jiang
- Journal Title
  
  IEICE Transactions on Information and Systems
  
  Volume: E99-D Issue: 10 Pages: 2585-2590
- DOI
  10.1587/transinf.2016edp7118
  10.1587/transinf.2016EDP7118
- NAID
  130005598253
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] On the capture time of Cops and Robbers game on a planar graph2016
- Author(s)
  Photchchara Pisantechakool and Xuehou Tan
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 10043 Pages: 3-17
- DOI
  10.1007/978-3-319-48749-6_1
- Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] Evacuation from an unknown effected area2016
- Author(s)
  Qi Wei, Xuehou Tan, Bo Jiang and Lijun Wang
- Journal Title
  
  Internal Journal of Pattern Recognition
  
  Volume: 30
- DOI
  10.1142/s0218001416590229
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00023
[Journal Article] Minimization of the maximum distance between the two guards patrolling a polygonal region2014
- Author(s)
  X. Tan and B. Jiang
- Journal Title
  
  Theoretic Computer Science
  
  Volume: Vol.532 Pages: 73-79
- DOI
  10.1016/j.tcs.2013.03.019
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Optimum sweeps of simple polygons with two guards2014
- Author(s)
  X. Tan and B. Jiang
- Journal Title
  
  Information Processing Letters
  
  Volume: Vol.114 Pages: 130-136
- DOI
  10.1016/j.ipl.2013.11.002
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Minimization of the maximal distance between the two guards patrolling a polygonal region2014
- Author(s)
  Xuehou Tan, Bo Jiang
- Journal Title
  
  Theoretical Computer Science
  
  Volume: ５３２ Pages: 73-79
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Finding simple paths on given points in a polygonal region2014
- Author(s)
  X. Tan and B. Jiang
- Journal Title
  
  Lect Notes Comput. Sci
  
  Volume: Vol.8479 Pages: 229-239
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Characterizing and recognizing LR-visibility polygons2014
- Author(s)
  X. Tan, B. Jiang and J. Zhang
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: Vol.165 Pages: 303-311
- DOI
  10.1016/j.dam.2012.10.030
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] A new approach to the upper bound on the average distance from the Fermat-Weber center of a convex body2013
- Author(s)
  Xuehou Tan, Bo Jiang
- Journal Title
  
  Lecture Notes on Computer Science
  
  Volume: ８２８７ Pages: 250-259
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Approximation algorithms for cutting a convex polyhedron from a sphere2013
- Author(s)
  Xuehou Tan, Gangshan Wu
- Journal Title
  
  Theoretic Computer Science
  
  Volume: 508 Pages: 66-73
- DOI
  10.1016/j.tcs.2012.03.035
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Optimal point movement for covering circular regions2013
- Author(s)
  D. Chen, X. Tan, H. Wang and G. Wu
- Journal Title
  
  Algorithmica
- DOI
  10.1007/s00453-013-9857-1
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] A new approach to the upper bound on the average distance from the Fermat-Weber center of a convex body2013
- Author(s)
  X. Tan and B. Jiang
- Journal Title
  
  Lect Notes Comput. Sci
  
  Volume: Vol.8287 Pages: 250-259
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Optimal point movement for covering circular regions2012
- Author(s)
  D. Chen, X. Tan, G. Wu and H. Wang
- Journal Title
  
  Lecture Notes in Compute Science
  
  Volume: 7076 Pages: 332-341
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Minimization of the maximum distance between the two guards patrolling a polygonal region2012
- Author(s)
  Xuehou Tan and Bo Jiang
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 7285 Pages: 47-57
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Minimization of the maximal distance between the two guards patrolling a polygonal region2012
- Author(s)
  Xuehou Tan and Bo Jiang
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 7285 Pages: 47-57
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Searching for mobile intruders in circular corridors by two 1-searchers2011
- Author(s)
  B. Jiang and X. Tan
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: Vol.159 Pages: 1793-1805
- DOI
  10.1016/j.dam.2010.10.007
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Searching for mobile intriders in circular corridors by two 1-searchers2011
- Author(s)
  Bo Jiang and Xuehou Tan
- Journal Title
  
  Discrete Applied Mathemetics
  
  Volume: 159 Pages: 1793-1805
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] Simple Characterization of LR-visibility polygons2011
- Author(s)
  Xuehou Tan, Jing Zhjang and Bo Jiang
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 7033 Pages: 176-187
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500024
[Journal Article] A unified and efficient solution to the room search problem2008
- Author(s)
  Xuehou Tan
- Journal Title
  
  Computational Geometry:Theory and Applications 40
  
  Pages: 45-60
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] A unified and efficient solution to the room search problem2008
- Author(s)
  Xuehou, Tan
- Journal Title
  
  Computational Geometry : Theory and applications 40
  
  Pages: 45-60
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] A unified and efficient solution to the room search problem2008
- Author(s)
  Xuehou Tan
- Journal Title
  
  Computational Geometry: Theory and Apphcations 40
  
  Pages: 45-60
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] A linear-time 2-approximation algorithm for the watchman route problem for simple polygons2007
- Author(s)
  Xuehou Tan
- Journal Title
  
  Theoretic Computer Science 384
  
  Pages: 92-103
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] Sweeping simple polygons with the minimum number of chain guards2007
- Author(s)
  Xuehou Tan
- Journal Title
  
  Information Processing Letters 102
  
  Pages: 66-71
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] Searching a polygonal region by two guards2007
- Author(s)
  Xuehou, Tan
- Journal Title
  
  Lecture Notes on Computer Science 4484
  
  Pages: 262-273
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] A linear-time 2-approximation algorithm for the watchman route problem for simple polygons2007
- Author(s)
  Xuehou, Tan
- Journal Title
  
  Theoretical Computer Science 384
  
  Pages: 92-103
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] Searching a polygonal region by two guards2007
- Author(s)
  Xuehou Tan
- Journal Title
  
  Lecture Notes in Computer Science 4484
  
  Pages: 262-273
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] Linear-time 2-approximation algorithm for the watchman route problem2006
- Author(s)
  Xuehou Tan
- Journal Title
  
  Lecture Notes in Computer Science 3959
  
  Pages: 181-191
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] A 2-approximation algorithm for the zookeeper' s route problem2006
- Author(s)
  Xuehou Tan
- Journal Title
  
  Information Processing Letters 100
  
  Pages: 183-187
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] Approximation algorithms for cutting out polygons with lines and rays2005
- Author(s)
  Xuehou Tan
- Journal Title
  
  Lecture Notes in Computer Science 3598
  
  Pages: 534-543
- Data Source
  KAKENHI-PROJECT-17500011
[Journal Article] An optimal algorithm for the 1-searchability of polygonal rooms2005
- Author(s)
  Xuehou Tan
- Journal Title
  
  Lecture Notes in Computer Science 3742
  
  Pages: 174-183
- Data Source
  KAKENHI-PROJECT-17500011
[Presentation] A characterization of link-2 LR-visibility polygons with applications2013
- Author(s)
  Bo Jiang, Xuehou Tan, Lijiuan Wang
- Organizer
  １６Th Japan Conference on Discrete and Computational Geometry and Graphs
- Place of Presentation
  東京理科大学
- Data Source
  KAKENHI-PROJECT-23500024
[Presentation] A characterization of link-2 LR-visibility polygons with applications2013
- Author(s)
  B. Jiang, X. Tan and L. Wang
- Organizer
  Proc. Of 16th Japan Conference on Discrete and Computational Geometry and Graphs
- Place of Presentation
  Tokyo, Japan
- Data Source
  KAKENHI-PROJECT-23500024
[Presentation] A new upper bound on the average distance from the Fermat-Weber center of a convex object2012
- Author(s)
  Xuehou Tan and Bo Jiang
- Organizer
  Thailand-Japan Joint Conference on Computational Geometry and Graphs
- Place of Presentation
  タイ・バンコク
- Data Source
  KAKENHI-PROJECT-23500024
[Presentation] A new upper bound on the average distance from the Fermat-Weber center of a convex body2012
- Author(s)
  X. Tan and B. Jiang
- Organizer
  Proc. Of Thai-Japan Joint Conference on Computational Geometry and Graphs
- Place of Presentation
  Bangkok, Thailand
- Data Source
  KAKENHI-PROJECT-23500024
[Presentation] A new competitive algorithm for exploring unknown polygons2008
- Author(s)
  譚学厚
- Organizer
  アルゴリズム研究会 (2008-Al-116)
- Place of Presentation
  法政大学
- Year and Date
  2008-01-23
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500011
[Presentation] A new competitive algorithm for exploring unknown polygons2008
- Author(s)
  Xuehou, Tan
- Organizer
  116th IPSJ algorithm workshop
- Place of Presentation
  Hosei University, Tokyo
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500011

Tan Xuehou 譚 学厚

TAN Xuehou 譚 学厚

譚 学厚 タン ガクコウ

Research Projects

Research Products

ドローネ三角網による平面的グラフの膨張因子とツーセンター問題の基礎研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

A study on the algorithms for touring a sequnec of geometric objectsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

A graph-based approach to the visibility-based pursuit-evasion problemPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

A study on the algorithms for searching a static or moving target in a polygonal regionPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

最短巡回路問題に関する最適なアルゴリズムの研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

最適経路問題に関するアルゴリズムの開発とその応用Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Book] Frontiners in Algorithmics and Algorithmic Aspects in Information and Management2013

Author(s)

Total Pages

Publisher

Data Source

[Book] Frontiers in Algorithmics and Algorithmic Aspects in Information and Management2013

Author(s)

Total Pages

Publisher

Data Source

[Journal Article] Simple Proof of the Lower Bound on the Average Distance from the Fermat-Weber Center of a Convex Body2022

Author(s)

Journal Title

DOI

NAID

ISSN

Language

Data Source

[Journal Article] The touring rays and related problems2021

Author(s)

Journal Title

DOI

Data Source

[Journal Article] On the upper bound on the average distance from the Fermat-Weber center of a convex body2021

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Polynomial-time algorithms for the touring rays and related problems2020

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Improved stretch factor of Delaunary triangulations of points in convex position2019

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Characterizing Link-2 LR-Visibility Polygons and Related Problems2019

Tan Xuehou 譚学厚

TAN Xuehou 譚学厚

譚学厚タンガクコウ