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 VLDB 2026 / reviewers in the wild / expert

Michael Kallay

dblp:91/2972 · DBLP profile ↗
← Back
12ranked-venue papers
8as first author
0since 2021 · last 2008
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 7 · 3 first-authorDatabases, data management, data science and information retrieval · 4 · 4 first-authorTheory of computation · 3 · 3 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorApplied, 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
2 papers
Geometric modeling and processing · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › shape modeling
curve and surface modeling		 0.011995
Object-oriented paradigm for curve and surface design · Comput. Aided Des. 1995
Programming languages and type systems
object-oriented programming		 0.011995
Object-oriented paradigm for curve and surface design · Comput. Aided Des. 1995

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

object-oriented design · 0.0
YearPublicationVenuePosition
2008 Geometric algorithms on an ellipsoid earth model
abstract
This paper outlines some geometric algorithms that are used in Microsoft SQL Server for processing geospatial data in a way that is independent of any cartographic projection.
Michael Kallay
 GIS1
2007 Defining edges on a round earth
abstract
On planar maps lines, polygons and polygonal paths are clearly defined by their endpoints and vertices, but on a round earth the definition of the connecting edges is far from obvious. This paper presents a definition, examines its properties, and proposes it as an industry standard. Algorithms based on this definition are outlined.
Michael Kallay
 GIS1
2001 A geometric Newton-Raphson strategy
Michael Kallay
 Comput. Aided Geom. Des.1
1995 Object-oriented paradigm for curve and surface design
Richard D. Fuhr, Lwo Hsieh, Michael Kallay
 Comput. Aided Des.3
1992 Computing the unit normal on a degenerate edge
Damien N. Berger, Michael Kallay
 Comput. Aided Des.2
1992 Monotone linear rational spline interpolation
Richard D. Fuhr, Michael Kallay
 Comput. Aided Geom. Des.2
1992 Subdivision Algorithms and the Kernel of a Polyhedron
Richard J. Gardner, Michael Kallay
 Discret. Comput. Geom.2
1991 General b-spline hermite interpolation
Michael Kallay
 Comput. Aided Geom. Des.1
1990 Optimal twist vectors as a tool for interpolating a network of curves with a minimum energy surface
Michael Kallay, Bahram Ravani
 Comput. Aided Geom. Des.1
1986 Convex Hull Made Easy
Michael Kallay
 Inf. Process. Lett.1
1986 Plane curves of minimal energy
abstract
The problem of finding the plane curve of minimal elastic energy with prescribed endpoints and end-directions was solved in 1983 by B. K. P. Horn. Here the solution is discussed, given a very short proof, and extended to include a constant on length.
Michael Kallay
 ACM Trans. Math. Softw.1
1984 The Complexity of Incremental Convex Hull Algorithms in Rd
Michael Kallay
 Inf. Process. Lett.1