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

A. Corbalan

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

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

Theory 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 · 100%

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

TopicWeightPapersLastEvidence papers
Computational geometry › distance measures
convex distance functions
0.011993
On the Topological Shape of Planar Voronoi Diagrams · SCG 1993
Computational geometry
metric geometry
0.011993
On the Topological Shape of Planar Voronoi Diagrams · SCG 1993
Computational geometry
voronoi diagram
0.011993
On the Topological Shape of Planar Voronoi Diagrams · SCG 1993

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

topology · 0.0
YearPublicationVenuePosition
1993 On the Topological Shape of Planar Voronoi Diagrams
abstract
Voronoi diagrams in the plane for strictly convex distances have been studied in [3], [5] and [7]. These distances induce the usual topology in the plane and, moreover, the Voronoi diagrams they produce enjoy many of the good properties of Euclidean Voronoi diagrams. Nevertheless, we show (Th.1) that it is not possible to transform, by means of a bijection from the plane into itself, the computation of such Voronoi diagrams to the computation of Euclidean Voronoi diagrams (except in the trivial case of the distance being affinely equivalent to the Euclidean distance). The same applies if we want to compute just the topological shape of a Voronoi diagram of at least four points (Th.2).
A. Corbalan, Marisa Mazón, Tomás Recio, Francisco Santos
SCG1