A Bibliography on Digital and Computational Convexity (1961-1988)

Authors:
Christian Ronse
Affiliations:
Philips Research Laboratory, Brussels, Belgium
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1989

Citing 100
Cited 7

Some performance tests of convex hull algorithms

BIT
An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons

Computing
Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm

SIAM Journal on Computing
A linear time algorithm for computing the convex hull of an ordered crossing polygon

Pattern Recognition
Optimal parallel algorithms for computing convex hulls and for sortng

Computing
Efficient planar convex hull algorithm

Image and Vision Computing
Finding extremal polygons

SIAM Journal on Computing
Computing the extreme distances between two convex polygons

Journal of Algorithms
Computational geometry: an introduction

Computational geometry: an introduction
Results and problems in combinatorial geometry

Results and problems in combinatorial geometry
A note on approximate convex hulls

Information Processing Letters
Planar point location using persistent search trees

Communications of the ACM
Searching and sorting similar lists

Journal of Algorithms
An optimal algorithm for finding minimal enclosing triangles

Journal of Algorithms
Computing the convex hull of line intersections

Journal of Algorithms
Polygon containment under translation

Journal of Algorithms
Convex hull made easy

Information Processing Letters
Shortest paths in the plane with convex polygonal obstacles

Information Processing Letters
Minimally covering a horizontally convex orthogonal polygon

SCG '86 Proceedings of the second annual symposium on Computational geometry
Best Linear Unbiased Estimators for Properties of Digitized Straight Lines

IEEE Transactions on Pattern Analysis and Machine Intelligence
Topologically sweeping an arrangement

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing higher-dimensional convex hulls at logarithmic cost per face

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Probing convex polytopes

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Covering the plane with convex polygons

Discrete & Computational Geometry
On shortest paths in polyhedral spaces

SIAM Journal on Computing
The ultimate planar convex hull algorithm

SIAM Journal on Computing
Optimal point location in a monotone subdivision

SIAM Journal on Computing
On the complexity of nonconvex covering

SIAM Journal on Computing
A strong chord property for 4-connected convex digital sets

Computer Vision, Graphics, and Image Processing
Digital straight segments

Computer Vision, Graphics, and Image Processing
On the index of concavity of neighbourhood templates

Acta Cybernetica
Determining the shape of a convex n-sided polygon by using 2n+k tactile probes

Information Processing Letters
A note on convex hull algorithms

Pattern Recognition
An efficient algorithm for obtaining the volume of a special kind of pyramid and application to convex polyhedra

Mathematics of Computation
Optimal computation of finitely oriented convex hulls

Information and Computation
On k-hulls and related problems

SIAM Journal on Computing
Intersection of convex objects in two and three dimensions

Journal of the ACM (JACM)
A new systolic architecture for convex hull and half-plane intersection problems

BIT
A Convex Hull Inclusion Test

IEEE Transactions on Pattern Analysis and Machine Intelligence
Unobstructed shortest paths in polyhedral environments

Unobstructed shortest paths in polyhedral environments
Generation of convex polygons with individual angular constraints

Information Processing Letters
An algorithm for determining an opaque minimal forest of a convex polygon

Information Processing Letters
A note on Graham`s convex hull algorithm

Information Processing Letters
A lower bound on the complexity of the convex hull problem for simple polyhedra

Information Processing Letters
On-line construction of the convex hull of a simple polyline

Information Processing Letters
Recursive subdivision without the convex hull property

Computer Aided Geometric Design
Convexity algorithms in parallel coordinates

Journal of the ACM (JACM)
Shape from probing

Journal of Algorithms
Convex hulls of piecewise-smooth Jordan curves

Journal of Algorithms
Fast approximation algorithms for a nonconvex covering problem

Journal of Algorithms
On shortest paths amidst convex polyhedra

SIAM Journal on Computing
On some distance problems in fixed orientations

SIAM Journal on Computing
A new O(n · logn) algorithm for computing the intersection of convex polygons

Pattern Recognition
Computing distance transformations in convex and non-convex domains

Pattern Recognition
Finding the convex hull of a sorted point set in parallel

Information Processing Letters
A geometric approach to subpixel registration accuracy

Computer Vision, Graphics, and Image Processing
Time and space efficient algorithms for shortest paths between convex polygons

Information Processing Letters
An O(n2) shortest path algorithm for a non-rotating convex body

Journal of Algorithms
Reconstruction of polygons from projections

Information Processing Letters
On-line sorting of twisted sequences in linear time

BIT
Quadratic problems defined on a convex hull of points

BIT
Computing the Width of a Set

IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Number of Digital Straight Line Segments

IEEE Transactions on Pattern Analysis and Machine Intelligence
On the detection of a common intersection of k convex objects in the plane

Information Processing Letters
Probing convex polygons with X-rays

SIAM Journal on Computing
On the shortest paths between two convex polyhedra

Journal of the ACM (JACM)
A Procedure for Detecting Intersections of Three-Dimensional Objects

Journal of the ACM (JACM)
An Algorithm for Convex Polytopes

Journal of the ACM (JACM)
On Limit Properties in Digitization Schemes

Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications

Journal of the ACM (JACM)
Two Algorithms for Determining Volumes of Convex Polyhedra

Journal of the ACM (JACM)
A Lower Bound to Finding Convex Hulls

Journal of the ACM (JACM)
Computing separating planes for pairs of disjoint polytopes

SCG '85 Proceedings of the first annual symposium on Computational geometry
Finding the optimal shadows of a convex polytope

SCG '85 Proceedings of the first annual symposium on Computational geometry
An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles

SCG '85 Proceedings of the first annual symposium on Computational geometry
Decomposing polygonal regions into convex quadrilaterals

SCG '85 Proceedings of the first annual symposium on Computational geometry
Computing the largest empty convex subset of a set of points

SCG '85 Proceedings of the first annual symposium on Computational geometry
Finding minimal convex nested polygons

SCG '85 Proceedings of the first annual symposium on Computational geometry
Computing a convex skill of an orthogonal polygon

SCG '85 Proceedings of the first annual symposium on Computational geometry
A New Convex Hull Algorithm for Planar Sets

ACM Transactions on Mathematical Software (TOMS)
Convex Decomposition of Simple Polygons

ACM Transactions on Graphics (TOG)
Efficient nesting of congruent convex figures

Communications of the ACM
Approximation algorithms for convex hulls

Communications of the ACM
Plane-sweep algorithms for intersecting geometric figures

Communications of the ACM
An optimal real-time algorithm for planar convex hulls

Communications of the ACM
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
Determining the minimum-area encasing rectangle for an arbitrary closed curve

Communications of the ACM
Parallel algorithms for the convex hull problem in two dimensions

CONPAR '81 Proceedings of the Conference on Analysing Problem Classes and Programming for Parallel Computing
Bounds on the Length of Convex Partitions of Polygons

Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science
Intersecting two polyhedra one of which is convex

FCT '85 Fundamentals of Computation Theory
Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete

FCT '85 Fundamentals of Computation Theory
Bilddarstellung durch konvexe Elementarmuster

Bildverarbeitung und Mustererkennung, DAGM Symposium
Convex decompositions of polyhedra

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Geometric complexity

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Decomposing a polygon into its convex parts

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Dynamically maintaining configurations in the plane (Detailed Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Detection is easier than computation (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On k-hulls and related problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions

A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology

Discretization in Hausdorff Space

Journal of Mathematical Imaging and Vision
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments

IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Lines and Digital Convexity

Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Digital lines and digital convexity

Digital and image geometry
Random generation of Q-convex sets

Theoretical Computer Science
From Binary to Grey Scale Convex Hulls

Fundamenta Informaticae
Optimal covering of a straight line applied to discrete convexity

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.14

Visualization

Abstract

A bibliography of 370 references of books, papers in serial journals, and conference papers, on convexity in relation to computer science is presented. The subject is divided into five topics: (1) convexity and straightness in digital images; (2) convex hull algorithms and their complexity; (3) other computational problems related to convexity; (4) miscellaneous applications; and (5) general mathematical sources. These references range in time from 1961 to September 1988.