default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFajie Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c18]Fajie Li, Xinbo Fu, Gisela Klette, Reinhard Klette:
A Fast Algorithm for Liver Surgery Planning. DGCI 2013: 228-240- 2011
- [b1]Fajie Li, Reinhard Klette:
Euclidean Shortest Paths - Exact or Approximate Algorithms. Springer 2011, ISBN 978-1-4471-2255-5, pp. I-XVII, 1-376 - [c17]Fajie Li, Reinhard Klette
:
Approximate Shortest Paths in Simple Polyhedra. DGCI 2011: 513-524 - 2010
- [c16]Fajie Li, Xiuxia Pan:
An Approximation Algorithm for Computing Minimum-Length Polygons in 3D Images. ACCV (4) 2010: 641-652 - [c15]Fajie Li, Reinhard Klette:
Watchman route in a simple polygon with a rubberband algorithm. CCCG 2010: 1-4 - [c14]Xiuxia Pan, Fajie Li, Reinhard Klette:
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons. CCCG 2010: 175-178
2000 – 2009
- 2009
- [c13]Fajie Li, Reinhard Klette:
Recovery Rate of Clustering Algorithms. PSIVT 2009: 1058-1069 - 2008
- [c12]Fajie Li, Reinhard Klette:
Calculating the Number of Tunnels. CIARP 2008: 421-428 - [c11]Fajie Li, Reinhard Klette:
A Variant of Adaptive Mean Shift-Based Clustering. ICONIP (1) 2008: 1002-1009 - [c10]Fajie Li, Reinhard Klette:
An Approximate Algorithm for Solving the Watchman Route Problem. RobVis 2008: 189-206 - 2007
- [j1]Fajie Li, Reinhard Klette:
Analysis of the rubberband algorithm. Image Vis. Comput. 25(10): 1588-1598 (2007) - [c9]Fajie Li, Reinhard Klette:
Euclidean Shortest Paths in Simple Cube Curves at a Glance. CAIP 2007: 661-668 - [c8]Fajie Li, Reinhard Klette:
Decomposing a Simple Polygon into Trapezoids. CAIP 2007: 726-733 - [c7]Fajie Li, Reinhard Klette:
Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems. ICCTA 2007: 9-19 - [c6]Fajie Li, Reinhard Klette, Xue Fu:
Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm. PSIVT 2007: 236-247 - [i1]Fajie Li, Reinhard Klette:
Euclidean Shortest Paths in Simple Cube Curves at a Glance. CoRR abs/0704.3197 (2007) - 2006
- [c5]Fajie Li, Reinhard Klette:
Shortest Paths in a Cuboidal World. IWCIA 2006: 415-429 - [c4]Fajie Li, Reinhard Klette:
Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm. PSIVT 2006: 280-291 - 2005
- [c3]Fajie Li, Reinhard Klette:
Minimum-Length Polygons of First-Class Simple Cube-Curves. CAIP 2005: 321-329 - [c2]Fajie Li, Reinhard Klette:
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points. DGCI 2005: 183-194 - 2004
- [c1]Fajie Li, Reinhard Klette:
Minimum-Length Polygon of a Simple Cube-Curve in 3D Space. IWCIA 2004: 502-511
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
