Skip to search formSkip to main contentSkip to account menu
Computational geometry: an introduction
TLDR
This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
View via Publisher
On the Connection Assignment Problem of Diagnosable Systems
TLDR
This paper treats the problem of automatic fault diagnosis for systems with multiple faults by means of a given arrangement of testing links (connection assignment), and a proper diagnosis can be arrived at for any diagnosable fault pattern.
View via Publisher
On Finding the Maxima of a Set of Vectors
TLDR
The problem of finding all maximal elements of V with respect to the partial ordering is considered and the computational com- plexity of the problem is defined to be the number of required comparisons of two components and is denoted by Cd(n).
View on ACM
The cube-connected cycles: a versatile network for parallel computation
TLDR
This work describes in detail how to program the cube-connected cycles for efficiently solving a large class of problems that include Fast Fourier transform, sorting, permutations, and derived algorithms.
View on ACM
Euclidean shortest paths in the presence of rectilinear barriers
TLDR
The goal is to find interesting cases for which the solution can be obtained without the explicit construction of the entire visibility graph, which solve the problems by constructing the shortest-path tree from the source to all the vertices of the obstacles and to the destination.
View via Publisher
Optimal Off-Line Detection of Repetitions in a String
View via Publisher
The cube-connected-cycles: A versatile network for parallel computation
TLDR
This work describes in detail how to program the cube-connected-cycles for efficiently solving a large class of problems, which includes Fast-Fourier-Transform, sorting, permutations, and derived algorithms, and the CCC can also be used as a general purpose parallel processor.
View on IEEE
Convex hulls of finite sets of points in two and three dimensions
TLDR
The presented algorithms use the “divide and conquer” technique and recursively apply a merge procedure for two nonintersecting convex hulls to ensure optimal time complexity within a multiplicative constant.
View on ACM
Computational Geometry
View on Springer
Finding the Intersection of two Convex Polyhedra
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License