Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search Publications by: Javier Bernal (Assoc)

Displaying 76 - 94 of 94

Computing Delaunay triangulations for comet-shaped polygons

November 1, 1991

Author(s)

Javier Bernal

In this paper, we present two triangulation algorithms which combined produce an algorithm for computing Delaunay triangulations for comet-shaped polygons. The first algorithm constructs in linear time a triangulation for a comet-shaped polygon. The second

An expected linear 3-dimensional Voronoi diagram algorithm

June 1, 1990

Author(s)

Javier Bernal

Let 5 be a set of n sites chosen independently from a uniform distribution in a cube in 3 dimensional Euclidean space. In this paper, an expected 0{n) algorithm for constructing the Voronoi diagram for 5 together with numerical results obtained from an

On the expected complexity of the 3-dimensional Voronoi diagram

May 1, 1990

Author(s)

Javier Bernal

Let 5 be a set of n sites chosen independently from a uniform distribution in a cube in 3dimensional Euclidean space. In this paper, work by Bentley, Weide and Yao is extended to show that the Voronoi diagram for 5 has an expected 0{n) number of faces. A

On constructing Delaunay triangulations for sets constrained by line segments

September 1, 1988

Author(s)

Javier Bernal

In this paper, we propose a simple algorithm for constructing a Delaunay triangulation for a finite set of points in the plane constrained by a finite collection of line segments. This algorithm constructs first a Delaunay triangulation for the set, and

Expected 0(N) and 0(N4/3) Algorithms for Constructing Voronoi Diagrams in Two and Three Dimensions

November 1, 1987

Author(s)

Javier Bernal

Bentley, Weide and Yao have proposed an expected 0(N) cell technique for computing Voronoi diagrams in two dimensions that does not generalize readily to three. In this paper their work is further developed and generalized to produce expected 0(N ) and 0

Contour-to-Grid Interpolation with Nonlinear Finite Elements: A Feasibility Study

September 1, 1987

Author(s)

Betty Mandel, Javier Bernal, Christoph J. Witzgall

The U.S. Army Engineer Topographic Laboratories and the National Bureau of Standards investigated the computational feasibility of developing a contour-to-grid algorithm by: (l) sampling a large set of digitized cartographic contour data with a tolerance

Non-Linear Contour-to-Grid Digital Interpolation

October 10, 1986

Author(s)

Betty Mandel, Christoph J. Witzgall, Javier Bernal

A technical approach to the task of performing a contour to grid conversion using nonlinear interpolation has been studied. The approach consists of reconstructing a terrain surface from the digitized contour lines on a map. The approximating surface is

Banach spaces that have normal structure and are isomorphic to a Hilbert space

April 1, 1984

Author(s)

Javier Bernal, F Sullivan

Multi-dimensional volumes, super-reflexivity and normal structure in Banach spaces

September 1, 1983

Author(s)

Javier Bernal, F Sullivan

Comments on the Structure of STIFS, in Selected Assessment Strategies Applied to Short-Term Energy Models

March 1, 1983

Author(s)

Javier Bernal, Robert E. Chapman, Lambert S. Joel

This section is concerned with the structure of STIFS and the effect it exerts on the model evaluation process. In order to present the subject matter in a more coherent manner as well as promote a smooth transition to the latter parts of the report, this

Was this page helpful?