By Topic

Proceedings of the IEEE

Issue 9 • Sept. 1992

Filter Results

Displaying Results 1 - 10 of 10
  • Scanning the issue - Computational geometry (special issue intro.)

    Publication Year: 1992, Page(s):1347 - 1363
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (1925 KB)
    Freely Available from IEEE
  • Interactive reconstruction via geometric probing

    Publication Year: 1992, Page(s):1364 - 1383
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1904 KB)

    Geometric probing considers problems of determining a geometric structure or some aspect of that structure from the results of a mathematical or physical measuring device, a probe. The field of geometric probing is surveyed, with results ordered by a probing model. The emphasis is on interactive reconstruction, where the results of all previous measurements are used to determine the orientation of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relative neighborhood graphs and their relatives

    Publication Year: 1992, Page(s):1502 - 1517
    Cited by:  Papers (258)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1604 KB)

    Results of neighborhood graphs are surveyed. Properties, bounds on the size, algorithms, and variants of the neighborhood graphs are discussed. Numerous applications including computational morphology, spatial analysis, pattern classification, and databases for computer vision are described View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of the Voronoi diagram for `one million' generators in single-precision arithmetic

    Publication Year: 1992, Page(s):1471 - 1484
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1148 KB)

    A numerically stable algorithm for constructing Voronoi diagrams in the plane is presented. In this algorithm higher priority is placed on the topological structure than on numerical values, so that, however large the numerical errors, the algorithm will never come across topological inconsistency and thus can always complete its task. The behavior of the algorithm is shown with examples, includin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recent results in art galleries [geometry]

    Publication Year: 1992, Page(s):1384 - 1399
    Cited by:  Papers (142)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1600 KB)

    Two points in a polygon are called if the straight line between them lies entirely inside the polygon. The art gallery problem for a polygon P is to find a minimum set of points G in P such that every point in P is visible from some point of G. The author provides an introduction to art gallery theorems and surveys the recent results of the field. The e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic mesh generation using the symmetric axis transformation of polygonal domains

    Publication Year: 1992, Page(s):1485 - 1501
    Cited by:  Papers (21)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1492 KB)

    An automatic method for generating finite element meshes for multiply connected planar domains with polygonal boundaries (i.e. planar polygons with polygonal holes) is described. The symmetric axis transform is used to obtain a planar graph that partitions the given domain. This transformation may introduce edges in the graph that are too long or too short for generating good meshes. A silver proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational geometry and computer graphics

    Publication Year: 1992, Page(s):1400 - 1411
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    The interaction between computer graphics and computational geometry is explored through two scenarios. Spatial subdivisions studied from the viewpoint of computational geometry are shown to have found application in computer graphics. Hidden surface removal problems of computer graphics have led to sweep-line and area subdivision algorithms in computational geometry. Two promising research area w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic algorithms in computational geometry

    Publication Year: 1992, Page(s):1412 - 1434
    Cited by:  Papers (29)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2276 KB)

    Dynamic algorithms and data structures in the area of computational geometry are surveyed. The work has a twofold purpose: it introduces the area to the nonspecialist and reviews the state of the art for the specialist. Fundamental data structures, such as balanced search trees and general techniques for dynamization, are reviewed. Range searching, intersections, point location, convex hull, and p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel techniques for computational geometry

    Publication Year: 1992, Page(s):1435 - 1448
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1448 KB)

    A survey of techniques for solving geometric problems in parallel is given, both for shared memory parallel machines and for networks of processors. Parallel models are reviewed, and basic subproblems that tend to arise in the solution of geometric problems on any parallel model, are discussed. PRAM techniques, techniques for mesh-connected arrays of processors, and the hybrid RAM/ARRAY model and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The contour problem for restricted-orientation polygons

    Publication Year: 1992, Page(s):1449 - 1470
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1944 KB)

    The problem of finding the contour of the union of a collection of polygons in which all vertices have integer coordinates and the slopes of the sides belong to a finite fixed collection of orientations is studied from two perspectives. The first is that of determining which algorithms for finding the contour of the union for rectilinear polygons and/or rectangles can be generalized to handle poly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The most highly-cited general interest journal in electrical engineering and computer science, the Proceedings is the best way to stay informed on an exemplary range of topics.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
H. Joel Trussell
North Carolina State University