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

P. Aerts

dblp:93/6408 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1988
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 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.

Computer graphics and multimedia
1 paper
Rendering · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Rendering › hidden surface removal
hidden-line removal		 0.011988
A hidden-line algorithm for graphical reconstruction of serially sectioned objects · Comput. Appl. Biosci. 1988

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

visibility computation · 0.0intersection search · 0.0
YearPublicationVenuePosition
1988 A hidden-line algorithm for graphical reconstruction of serially sectioned objects
abstract
An algorithm for hidden-line removal in graphical reconstructions of serially sectioned biological objects is developed for PC-like computer configurations. The aim is to handle complicated structures defined by vast numbers of coordinate pairs and intersections between contours, without requiring excessive computing time. The procedure depends upon a fast searching routine for the localization of intersections and visibility.
W. Vanden Berghe, P. Aerts
 Comput. Appl. Biosci.2