Dynamic computational geometry on meshes and hypercubes

Laurence Boxer; Russ Miller

Dynamic computational geometry on meshes and hypercubes

Laurence Boxer
, Russ Miller

Department of Computer Science and Engineering

University at Buffalo

Niagara University

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

Parallel algorithms for determining geometric properties of systems of moving objects are given. The properties investigated include nearest (farthest) neighbor, closest (farthest) pair, collision, convex hull, diameter, and containment. Several of these properties are investigated from both the dynamic and steady-state points of view. Efficient, and often optimal, implementation of these algorithms for the mesh and hypercube are given.

Original language	English
Pages (from-to)	323-330
Number of pages	8
Journal	Proceedings of the International Conference on Parallel Processing
Volume	1
State	Published - 1988

Cite this

@article{42681669aaa0415bb9d72289d6d3f46a,

title = "Dynamic computational geometry on meshes and hypercubes",

abstract = "Parallel algorithms for determining geometric properties of systems of moving objects are given. The properties investigated include nearest (farthest) neighbor, closest (farthest) pair, collision, convex hull, diameter, and containment. Several of these properties are investigated from both the dynamic and steady-state points of view. Efficient, and often optimal, implementation of these algorithms for the mesh and hypercube are given.",

author = "Laurence Boxer and Russ Miller",

year = "1988",

language = "English",

volume = "1",

pages = "323--330",

journal = "Proceedings of the International Conference on Parallel Processing",

issn = "0190-3918",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Dynamic computational geometry on meshes and hypercubes

AU - Boxer, Laurence

AU - Miller, Russ

PY - 1988

Y1 - 1988

N2 - Parallel algorithms for determining geometric properties of systems of moving objects are given. The properties investigated include nearest (farthest) neighbor, closest (farthest) pair, collision, convex hull, diameter, and containment. Several of these properties are investigated from both the dynamic and steady-state points of view. Efficient, and often optimal, implementation of these algorithms for the mesh and hypercube are given.

AB - Parallel algorithms for determining geometric properties of systems of moving objects are given. The properties investigated include nearest (farthest) neighbor, closest (farthest) pair, collision, convex hull, diameter, and containment. Several of these properties are investigated from both the dynamic and steady-state points of view. Efficient, and often optimal, implementation of these algorithms for the mesh and hypercube are given.

UR - https://www.scopus.com/pages/publications/0024130749

M3 - Conference article

SN - 0190-3918

VL - 1

SP - 323

EP - 330

JO - Proceedings of the International Conference on Parallel Processing

JF - Proceedings of the International Conference on Parallel Processing

ER -

Dynamic computational geometry on meshes and hypercubes

Abstract

Other files and links

Fingerprint

Cite this