Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Jenn-Yih Lin

dblp:86/6807 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational geometry · 50% Algorithms and data structures · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry
convex hull		 0.011998
A 1 log N parallel algorithm for detecting convex hulls on image boards · IEEE Trans. Image Process. 1998
Algorithms and data structures
parallel algorithms		 0.011998
A 1 log N parallel algorithm for detecting convex hulls on image boards · IEEE Trans. Image Process. 1998

Methods — techniques the papers use, named apart from their topics

parallel algorithm · 0.0
YearPublicationVenuePosition
1999 A study on the dual vanishing point property
Jen-Bin Huang, Zen Chen, Jenn-Yih Lin
 Pattern Recognit.3
1998 A 1 log N parallel algorithm for detecting convex hulls on image boards
abstract
By finding the maximum and minimum of {y/sub i/-mx/sub i/|1/spl les/i/spl les/N} for certain slopes m, we propose here a simple and fast parallel algorithm to obtain the convex hull of N arbitrarily given points on an image board, The mathematical theory needed is included, and computation time is 1 log N.
Ja-Chen Lin, Jenn-Yih Lin
 IEEE Trans. Image Process.2
1996 Identification of business forms using relationships between adjacent frames (*)
Jenn-Yih Lin, Chi-Wei Lee, Zen Chen
 Mach. Vis. Appl.1
1995 A Chinese-character thinning algorithm based on global features and contour information
Jenn-Yih Lin, Zen Chen
 Pattern Recognit.1