The main goal of this project is to develop a parallel tetrahedral mesh generator based on existing sequential mesh generation software. As sequential mesh generation software, the Netgen mesh generator was used due to its availability as LGPL open source software and its wide user base. Parallel mesh generation routines were developed using the MPI libraries and the C++ language. The parallel ...

A scheme is presented for analising nite-element triangulations. The method takes a random triangulated planar graph and gives a multifrontal way to solve the corresponding physical problem, so that the maximum bandwidth of each front is guaranteed to be \optimal". The interesting characteristic of this scheme is that it introduces large-grained parallelism dictated by the domain structure. A w...

The existence of parallel mates to a given closed space curves in the sense of depends on its total normal twist, i.e. the angle of rotation of a normal vector subject to parallel transfer in the normal bundle after one period. Parallel mates exist ii this quantity is an integer multiple of 2. The aim of this note is to investigate the change of the total normal twist under isotopic deformation...

Parallel mesh generation is a relatively new research area between the boundaries of two scientific computing disciplines: computational geometry and parallel computing. In this chapter we present a survey of parallel unstructured mesh generation methods. Parallel mesh generation methods decompose the original mesh generation problem into smaller subproblems which are meshed in parallel. We org...

Constructive Solid Geometry (CSG) has been used in several model-based vision programs, most notably in ACRONYM. This paper examines some of the problems that arise with CSG and proposes constraints that make CSG a unique representation of scenes. It is also suggested that Additive Constructive Solid Geometry (ACSG) is more useful for vision because it leads to simpler computation of connectivi...

We present parallel algorithms to nd cut vertices, bridges, and Hamiltonian Path in bounded interval tolerance graphs. For a graph with n vertices, the algorithms require O(logn) time and use O(n) processors to run on Concurrent Read Exclusive Write Parallel RAM (CREW PRAM) model of computation. Our approach transforms the original graph problem to a problem in computational geometry. The total...

We are all familiar with Euclidean geometry and with the fact that it describes our three dimensional world so well In Euclidean geometry the sides of objects have lengths inter secting lines determine angles between them and two lines are said to be parallel if they lie in the same plane and never meet Moreover these properties do not change when the Euclidean transformations translation and r...

An algorithm is introduced for converting a non-conforming hexahedral mesh that is topologically equivalent and geometrically similar to a given geometry into a conforming mesh for the geometry. The procedure involves embedding geometric topology information into the given non-conforming base mesh and then converting the mesh to a fundamental hexahedral mesh. The procedure is extensible to mult...

Geometry representations in production Monte Carlo radiation transport codes used for linear-transport simulations are traditionally limited to combinatorial geometry (CG) topologies. While CG representations of input geometries are efficient to query, they are difficult to construct. In the Integrated-TIGER-Series (ITS) Monte Carlo code suite, a new approach for radiation transport geometry en...