Hierarchische Darstellung geometrischer Objekte und ihre algorithmische Bedeutung

@inproceedings{Lengauer1986HierarchischeDG,
  title={Hierarchische Darstellung geometrischer Objekte und ihre algorithmische Bedeutung},
  author={Thomas Lengauer},
  booktitle={GI Jahrestagung},
  year={1986}
}
In den Ingenieurwissenschaften - etwa beim Entwurf grostintegrierter Schaltkreise - fallen grose Datenmengen an, die hierarchisch strukturiert sind. Bestehende Entwurfssysteme unterstutzen zwar die Eingabe in hierarchischer Form. Die Verarbeitung der Daten geschieht jedoch nichthierarchisch nach einer Phase der Datenexpansion. Wir diskutieren, inwieweit die in der Hierarchischen Definition verborgene Struktur ausgenutzt werden kann, um die Verarbeitung von grosen Mengen geometrischer Daten… 

References

SHOWING 1-10 OF 36 REFERENCES

Über die partiellen Differenzengleichungen der mathematischen Physik

----------------------------------------------------Nutzungsbedingungen DigiZeitschriften e.V. gewährt ein nicht exklusives, nicht übertragbares, persönliches und beschränktes Recht auf Nutzung

Hierarchical Planary Testing Algorithms

This work presents a hierarchical graph model that permits to exploit the hierarchy and gives algorithms that test planarity of a hierarchically described graph in linear time in the length of the hierarchical description.

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

This paper uses F-heaps to obtain fast algorithms for finding minimum spanning trees in undirected and directed graphs and can be extended to allow a degree constraint at one vertex.

Succinct Representations of Graphs

The Complexity of Manipulating Hierarchically Defined Sets of Rectangles

This paper studies the complexity of rectangle problems when the inputs are given in a hierarchical language that allows the designer to build large designs by replicating small designs, and sees that while most of the problems are NP-hard in the general case, there are O(N log N) algorithms that process inputs obeying certain restrictions.

The quad-cif tree a data structure for h

The quad-CIF tree data structure is described and it is outlined how one can use the data structure in order to implement hierarchical, on-line design rule checking and node extraction.

An Efficient Program for Many-Body Simulation

This paper describes both the particular program and the methodology underlying such speedups that reduced the running time of a large problem $(N = 10,000)$ by a factor of four hundred.

On pressure boundary conditions for the incompressible Navier‐Stokes equations

The pressure is a somewhat mysterious quantity in incompressible flows. It is not a thermodynamic variable as there is no ‘equation of state’ for an incompressible fluid. It is in one sense a