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

James C. Alexander

dblp:94/1850 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author

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.

Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 50% Visualization and visual analytics · 50%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval
image analysis
0.011971
The Boundary Count of Digital Pictures · J. ACM 1971
Visualization and visual analytics
topological data analysis
0.011971
The Boundary Count of Digital Pictures · J. ACM 1971
Computational geometry
digital geometry
0.011971
The Boundary Count of Digital Pictures · J. ACM 1971
Computational geometry › digital geometry
digital topology
0.011971
The Boundary Count of Digital Pictures · J. ACM 1971

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

cell complexes · 0.0
YearPublicationVenuePosition
1998 Shortest distance paths for wheeled mobile robots
abstract
Minimal distance paths between prescribed initial and final configurations of a wheeled mobile robot are calculated, both analytically and numerically, using methods of optimal control. The construction of these trajectories can be considered as part of an analysis of obstacle avoidance.
James C. Alexander, John H. Maddocks, Brian A. Michalowski
IEEE Trans. Robotics Autom.1
1971 The Boundary Count of Digital Pictures
abstract
Cell complexes are associated with digital pictures in a natural way.The resulting topological concepts, e.g.components and fundamental group, agree with the standard usages.The notion of a boundary curve of a digital picture is defined, and with it, for any element a in the picture, two boundary counts, which are essentially (1) the number of times some bound° ary curve passes through ,~, and (2) the number of such curves.These concepts capture most vf the topology of the picture, and also solve the problem of finding the "removable" elements of the picture.
James C. Alexander, A. I. Thaler
J. ACM1