Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2007

2007

A disk graph is an intersection graph of a set of disks with arbitrary radii in the plane. In this paper, we consider the problem… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

In this paper we present C 2 P, a new clustering algorithm for large spatial databases, which exploits spatial access methods for… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

Abstract This paper presents the Hierarchical Walk , or H-Walk algorithm, which maintains the distance between two moving convex… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

This article presents the Voronoi-clip, or V-Clip, collision detection alogrithm for polyhedral objects specified by a boundary… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

The following two computational problems are studied:Duplicate grouping:Assume thatnitems are given, each of which is labeled by… Expand

Is this relevant?

1997

1997

In many applications of computational geometry to modeling objects and processes in the physical world, the participating objects… Expand

Is this relevant?

Highly Cited

1980

Highly Cited

1980

Most results in the field of algorithm design are single algorithms that solve single problems. In this paper we discuss… Expand

Is this relevant?

Highly Cited

1966

Highly Cited

1966

AGGLOMERATIVE hierarchical methods of computer classification all begin by calculating distance-measures between elements. The… Expand

Is this relevant?