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

Cecil Jose A. Delfinado

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

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1 · 1 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.

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

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

TopicWeightPapersLastEvidence papers
Computational geometry › computational topology
alpha shapes		 0.011993
An Incremental Algorithm for Betti Numbers of Simplicial Complexes · SCG 1993
Computational geometry › computational topology
betti number computation		 0.011993
An Incremental Algorithm for Betti Numbers of Simplicial Complexes · SCG 1993
Algorithms and data structures › dynamic algorithms
incremental algorithms		 0.011993
An Incremental Algorithm for Betti Numbers of Simplicial Complexes · SCG 1993
Computational geometry
shape analysis		 0.011993
An Incremental Algorithm for Betti Numbers of Simplicial Complexes · SCG 1993
Computational geometry
topological data analysis		 0.011993
An Incremental Algorithm for Betti Numbers of Simplicial Complexes · SCG 1993

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

incremental algorithm · 0.0homology computation · 0.0
YearPublicationVenuePosition
1995 An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
Cecil Jose A. Delfinado, Herbert Edelsbrunner
 Comput. Aided Geom. Des.1
1993 An Incremental Algorithm for Betti Numbers of Simplicial Complexes
abstract
A general and direct method for computing the betti numbers of the homology groups of a finite simplicial complex is given. For subcomplexes of a triangulation of S3 this method has implementations that run in time O(nα(n)) and O(n), where n is the number of simplices in the triangulation. If applied to the family of α-shapes of a finite point set in ℝ3 it takes time O(nℝ(n)) to compute the betti numbers of all α-shapes.
Cecil Jose A. Delfinado, Herbert Edelsbrunner
 SCG1