Primitives for the manipulation of three-dimensional subdivisions

Dobkin, David P.; Laszlo, Michael

doi:10.1007/bf01553877

Cited by 126 publications

(17 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Conversely, Puppo et a1. [23] propose a parallel solution designed for data-parallel architectures; their solution has been implemented on a Thinking Machine CM2, and computes triangulations in E2 space only.…”

Section: 1mentioning

confidence: 99%

“…In this Section we briefly present InCoDe (incremental construction of Delaunay triangulation), which was formerly proposed as a generalized and optimized Ed extension of McLain's algorithm [6]. A similar approach was also applied by Dobkin and Laszlo [23] for E3 subdivisions, and recently revised and implemented by Fang and Piegl to build triangulations in E2 space[ lo].…”

mentioning

confidence: 99%

See 1 more Smart Citation

Evaluation of parallelization strategies for an incremental Delaunay triangulator in e³

Cignoni

Laforenza

Perego

et al. 1995

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

SUMMARYThe paper deals with the parallelization of Delaunay triangulation, a widely used space partitioning technique. Two parallel implementations of a three-dimensional incremental consfruction algorithm are presented.The first is based on the decomposition of the spatial domain, while the second relies on the master-slaves approach. Both parallelization strategies are evaluated, stressing practical issues rather than theoretical complexity. We report on the exploitation of two different parallel environments: a tightly coupled distributed memory MIMD architecture and a network of workstations co-operating under the Linda environment. Then, a third hybrid solution is proposed,specificaUy addressed to the exploitation of higher parallelism. It combines the other two solutions by grouping the processing nodes of the multicomputer into clusters and by exploiting parallelism at two different levels.

show abstract

Section: 1mentioning

confidence: 99%

mentioning

confidence: 99%

Evaluation of parallelization strategies for an incremental Delaunay triangulator in e³

Cignoni

Laforenza

Perego

et al. 1995

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

show abstract

“…A second parallel solution, aimed at increasing scalability, is presented in this section. The solution is based on an incremental construction method [19] [8]; the characteristics of this class of algorithms were briefly introduced in Sections 2 and 3, and a detailed description of one particular implementation, the InCoDe algorithm, can be found in [5].…”

Section: A Parallel Increment Al Construct Ion Algorithmmentioning

confidence: 99%

Parallel 3D Delaunay Triangulation

Cignoni

Montani

Perego

et al. 1993

Computer Graphics Forum

View full text Add to dashboard Cite

The paper deals with the parallelization of Delaunay triangulation algorithms, giving more emphasis to pratical issues and implementation than to theoretical complexity. Two parallel implementations are presented. The first one is built on De Wall, an Ed triangulator based on an original interpretation of the divide & conquer paradigm. The second is based on an incremental construction algorithm. The parallelization strategies are presented and evaluated. The target parallel machine is a distributed computing environment, composed of coarse grain processing nodes. Results of first implementations are reported and compared with the performance of the serial versions running on a Unix workstation.

show abstract

“…We are studying the stimulation of metamorphoses of any subdivisions of any surfaces. Similarly, this method can be extended to simulate evolutions of subdivisions of threedimensional spaces (new topological models have been recently defined for the representation of the topology of subdivisions of 3D spaces and nD spaces [42][43][44][45] ).…”

Section: Various Developments Are Studied For Instancementioning

confidence: 99%

Modelling and Programming Evolutions of Surfaces

Chen

Lienhardt

1992

Computer Graphics Forum

View full text Add to dashboard Cite

In recent years, a lot of work has been done on modelling natural phenomena and simulating the evolution of natural objects. For instance, procedural methods have been developed for simulating corpuscular phenomena and tree growth. In this paper we present a new procedural method for simulating evolutions of subdivisions of surfaces (i.e. partitions of surfaces into vertices, edges and faces). The representations of topology, embedding and photometry are clearly distinguished in the geometric model used for the representation of such subdivisions and thus, each of these features may be evolved independently (as in natural metamorphoses). Evolutions are achieved by applying topological and embedding operations on the geometric model. Control of these evolutions is based upon the behaviour concept. Behaviours (i.e. sets of operations) are associated with cells of the modelled subdivision. At each step, and for each cell, the corresponding behaviour is applied to the cell. The definition and computation of parameters have been studied, in order to control such evolutions. The method has been implemented and tested with many examples of surface evolutions (mainly evolutions of vegetal surfaces: leaves, flowers). Based on the method, a language has been defined for programming surface evolutions.

show abstract

Primitives for the manipulation of three-dimensional subdivisions

Cited by 126 publications

References 5 publications

Evaluation of parallelization strategies for an incremental Delaunay triangulator in e³

Evaluation of parallelization strategies for an incremental Delaunay triangulator in e³

Parallel 3D Delaunay Triangulation

Modelling and Programming Evolutions of Surfaces

Contact Info

Product

Resources

About

Primitives for the manipulation of three-dimensional subdivisions

Cited by 126 publications

References 5 publications

Evaluation of parallelization strategies for an incremental Delaunay triangulator in e3

Evaluation of parallelization strategies for an incremental Delaunay triangulator in e3

Parallel 3D Delaunay Triangulation

Modelling and Programming Evolutions of Surfaces

Contact Info

Product

Resources

About

Evaluation of parallelization strategies for an incremental Delaunay triangulator in e³

Evaluation of parallelization strategies for an incremental Delaunay triangulator in e³