1995 - ACM Fellow For significant research contributions in Computational Geometry, Parallel Algorithms, Theory of VLSI Layouts, Fault Diagnosis in Computer Systems, and Algebraic Coding Theory.
Franco P. Preparata focuses on Combinatorics, Discrete mathematics, Algorithm, Computational geometry and Convex hull. His Combinatorics study combines topics from a wide range of disciplines, such as Space and Intersection, Line segment intersection. His Algorithm study frequently draws connections between related disciplines such as Boundary.
His Computational geometry research is multidisciplinary, incorporating perspectives in Real RAM, Plane, Sweep line algorithm and Calculus. His Calculus research incorporates themes from Bowyer–Watson algorithm and Closest pair of points problem. Franco P. Preparata interconnects Radon's theorem, Convex polytope and Orthogonal convex hull in the investigation of issues within Convex hull.
His main research concerns Combinatorics, Algorithm, Discrete mathematics, Computation and Very-large-scale integration. The Combinatorics study combines topics in areas such as Computational geometry, Point location and Convex hull. His Computational geometry research integrates issues from Plane and Regular polygon.
His work on Theory of computation as part of general Algorithm study is frequently linked to Sequencing by hybridization, therefore connecting diverse disciplines of science. His study in Discrete mathematics is interdisciplinary in nature, drawing from both Computational complexity theory and Linear code. His biological study spans a wide range of topics, including Theoretical computer science, Chip, Parallel computing, Sorting and Integrated circuit.
Franco P. Preparata mainly focuses on Algorithm, Sequencing by hybridization, Algorithmics, DNA sequencing and Genetics. His research in Algorithm intersects with topics in Position and Standard deviation. His Algorithmics research incorporates elements of Theoretical computer science, Industrial engineering, Theory of computation, Library science and Computational geometry.
His Theoretical computer science research is multidisciplinary, relying on both Parameterized complexity, Cluster analysis, Binary search tree, Streaming algorithm and Spanning tree. His study explores the link between Theory of computation and topics such as Artificial intelligence that cross with problems in Filter, Subsequence and Dynamic programming. His Data point research includes elements of Time complexity and Roundness, Hyperboloid, Geometry.
Franco P. Preparata mostly deals with Algorithm, Metrology, Mathematical optimization, Genetics and DNA microarray. His work in the fields of Algorithm, such as Data point, intersects with other areas such as Sensor node. He has researched Data point in several fields, including Time complexity, Roundness and Linearization.
The concepts of his Metrology study are interwoven with issues in Combinatorics, Geometry, Radius, Algebraic number and Space. Franco P. Preparata has included themes like Cylinder, Hyperboloid and Markov systems in his Mathematical optimization study. His DNA sequencing and DNA study, which is part of a larger body of work in Genetics, is frequently linked to Sequencing by hybridization, Important conclusion and De novo sequencing, bridging the gap between disciplines.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Computational Geometry: An Introduction
Franco P. Preparata;Michael I. Shamos.
(1978)
Computational Geometry: An Introduction
Franco P. Preparata;Michael I. Shamos.
(1978)
On the Connection Assignment Problem of Diagnosable Systems
Franco P. Preparata;Gernot Metze;Robert T. Chien.
IEEE Transactions on Electronic Computers (1967)
On the Connection Assignment Problem of Diagnosable Systems
Franco P. Preparata;Gernot Metze;Robert T. Chien.
IEEE Transactions on Electronic Computers (1967)
The cube-connected cycles: a versatile network for parallel computation
Franco P. Preparata;Jean Vuillemin.
Communications of The ACM (1981)
The cube-connected cycles: a versatile network for parallel computation
Franco P. Preparata;Jean Vuillemin.
Communications of The ACM (1981)
On Finding the Maxima of a Set of Vectors
H. T. Kung;F. Luccio;F. P. Preparata.
Journal of the ACM (1975)
On Finding the Maxima of a Set of Vectors
H. T. Kung;F. Luccio;F. P. Preparata.
Journal of the ACM (1975)
Convex hulls of finite sets of points in two and three dimensions
F. P. Preparata;S. J. Hong.
Communications of The ACM (1977)
Convex hulls of finite sets of points in two and three dimensions
F. P. Preparata;S. J. Hong.
Communications of The ACM (1977)
Computational Geometry: Theory and Applications
(Impact Factor: 0.455)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Brown University
Academia Sinica
Max Planck Institute for Informatics
University of Mississippi
Université Côte d'Azur
University of Perugia
University of Illinois at Urbana-Champaign
Brown University
Institute of Science and Technology Austria
National University of Singapore
Tel Aviv University
University of Pennsylvania
University of Sussex
Spanish National Research Council
Kyoto University
Sofia University
Wageningen University & Research
University of Zurich
Ludwig-Maximilians-Universität München
Planetary Science Institute
University College London
Children's Hospital of Philadelphia
Australian Catholic University
Tohoku University
University of Bristol
Karolinska Institute