Lihong Ma 0001

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

dblp:03/6494-1 · DBLP profile ↗

← Back

7ranked-venue papers

0as first author

0since 2021 · last 2003

0000-0002-2732-6030ORCID · corroborated

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

Theory of computation · 7Databases, data management, data science and information retrieval · 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.

Theoretical computer science

3 papers

Computational geometry · 100%

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

Topic	Papers	Last	Evidence papers
Computational geometry distance measures	2	1999	On Bisectors for Different Distance Functions · SCG 1999 Convex Distance Functions in 3-Space are Different · SCG 1993
Computational geometry combinatorial complexity	1	2001	A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D · STOC 2001
Computational geometry voronoi diagram	1	2001	A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D · STOC 2001
Computational geometry bisector	1	1999	On Bisectors for Different Distance Functions · SCG 1999
Computational geometry › distance measures convex distance functions	1	1993	Convex Distance Functions in 3-Space are Different · SCG 1993

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

convex distance function · 0.0combinatorial geometry · 0.0

Year	Publication	Venue	Position
2003	Voronoi Diagram for services neighboring a highway Manuel Abellanas, Ferran Hurtado, Vera Sacristán Adinolfi, Christian Icking, Lihong Ma 0001, Rolf Klein, Elmar Langetepe, Belén Palop	Inf. Process. Lett.	5
2001	Smallest Color-Spanning Objects Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma 0001, Belén Palop, Vera Sacristán Adinolfi	ESA	6
2001	A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D abstract We consider the Voronoi diagram of a set of n points in three dimensions under a convex distance function induced by an arbitrary, fixed polytope. The combinatorial complexity, i.\,e.\ the number of vertices, edges, and facets, of this diagram is shown to be in θ(n^2), which constitutes a considerable improvement to the results known so far. Christian Icking, Lihong Ma 0001	STOC	2
2001	On bisectors for different distance functions Christian Icking, Rolf Klein, Lihong Ma 0001, Stefan Nickel, Ansgar Weißler	Discret. Appl. Math.	3
1999	On Bisectors for Different Distance Functions abstract Let #C and #D be two convex distance functions in the plane with convex unit balls C and D. Given two points, p and q, we investigate the bisector, B(p, q), of p and q, where distance from p is measured by #C and distance from q by #D . We provide the following results. B(p, q) may consist of many connected components whose precise number can be derived from the intersection of the unit balls, C and D. The bisector can contain bounded or unbounded 2-dimensional areas. Even more surprising, pieces of the bisector may appear inside the region of all points closer to p than to q. Christian Icking, Rolf Klein, Lihong Ma 0001, Stefan Nickel, Ansgar Weißler	SCG	3
1995	Convex Distance Functions in 3-Space are Different abstract The bisector systems of convex distance functions in 3-space are investigated and it is shown that there is a substantial difference to the Euclidean metric which cannot be observed in 2-space. This disproves the general belief that Voronoi diagrams Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma 0001	Fundam. Informaticae	4
1993	Convex Distance Functions in 3-Space are Different abstract Article Convex distance functions in 3-space are different Share on Authors: Christian Icking View Profile , Rolf Klein View Profile , Ngoc-Minh Lê View Profile , Lihong Ma View Profile Authors Info & Claims SCG '93: Proceedings of the ninth annual symposium on Computational geometryJuly 1993 Pages 116–123https://doi.org/10.1145/160985.161007Published:01 July 1993 12citation252DownloadsMetricsTotal Citations12Total Downloads252Last 12 Months6Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma 0001	SCG	4