An optimal algorithm for computing the closure of a set of planar rectangles and locked-transaction systems [C.T.I. Technical Report] TR. 90.11.34
| Main Authors: | Αλεβίζος, Π. (Author), Μπιστιόλας, Βαγγέλης (Author), Σοφοτάσιος, Δημήτριος Π. (Author), Τσακαλίδης, Αθανάσιος (Author) |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Πάτρα Ελλάδα
Ινστιτούτο Τεχνολογίας Υπολογιστών
1990
|
| Subjects: |
Similar Items
-
Computing Rectangle Enclosures [C.T.I. Technical Report] TR. 90.12.36
by: Μπιστιόλας, Βαγγέλης, et al.
Published: (1990) -
Efficient Range Searching in a set of planar line Segments [C.T.I. Technical Reports] TR. 90.08.20
by: Μπιστιόλας, Βαγγέλης, et al.
Published: (1990) -
On point and segment enclosures C.T.I. Technical Report TR. 90.06.18
by: Μπιστιόλας, Βαγγέλης, et al.
Published: (1990) -
Computing Shortest Paths and Distances in Planar Graphs [C.T.I.] Technical Report TR 90.10.26
by: Djidjeu, Hristo N., et al.
Published: (1990) -
Efficient Parallel Algorithms for Shortest Paths in Planar Graphs C.T.I. Technical Report TR. 90.01.02
by: Πάντζιου, Γραμματή, et al.
Published: (1990)