#### Filter Results:

- Full text PDF available (143)

#### Publication Year

1963

2017

- This year (5)
- Last 5 years (23)
- Last 10 years (71)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- Joseph O'Rourke
- SIGACT News
- 1998

Several recent SIGGRAPH papers on surface simplification are described.

- Subhash Suri, Joseph O'Rourke
- Symposium on Computational Geometry
- 1986

EIGindy and Avis [EA] considered the problem of determining the visibility polygon from a point inside a polygon. Their algorithm runs in optimal O(n ) time and space, where n is the number of the vertices of the given polygon. Later their result was generalized to visibility polygons from an edge by EIGindy [Eli, and Lee and Lin ILL I. Both independently… (More)

- Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
- 24th Annual Symposium on Foundations of Computer…
- 1983

An optimal algorithm is presented for constructing an arrangement of hyperplanes in arbitrary dimensions. It relies on a combinatorial result that is of interest in its own right. The algorithm is shown to improve known worst-case time complexities for five problems: computing all order-k Voronoi diagrams, computing the λ-matrix, estimating halfspace… (More)

- Joseph O'Rourke, Nonnan I. Badler
- IEEE Transactions on Pattern Analysis and Machine…
- 1980

A system capable of analyzing image sequences of human motion is described. The system is structured as a feedback loop between high and low levels: predictions are made at the semantic level and verifications are sought at the image level. The domain of human motion lends itself to a model-driven analysis, and the system includes a detailed model of the… (More)

- Joseph O'Rourke
- International Journal of Computer & Information…
- 1985

The problem of finding minimal volume boxes circumscribing a given set of three-dimensional points is investigated. It is shown that it is not necessary for a minimum volume box to have any sides flush with a face of the convex hull of the set of points, which makes a naive search problematic. Nevertheless, it is proven that at least two adjacent box sides… (More)

- Joseph O'Rourke, Kenneth J. Supowit
- IEEE Trans. Information Theory
- 1983

The inherent computational complexity of polygon decomposition problems is of theoretical interest to researchers in the field of computational geometry and of practical interest to those working in syntactic pattern recognition. Three polygon decomposit ion problems are shown to be NP-hard and thus unlikely to admit efficient algorithms. The problems are… (More)

- Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
- SIAM J. Comput.
- 1997

We introduce the notion of a star unfolding of the surface P of a three-dimensional convex polytope with n vertices, and use it to solve several problems related to shortest paths on P. The first algorithm computes the edge sequences traversed by shortest paths on P in time O(n6β(n) logn), where β(n) is an extremely slowly growing function. A much simpler… (More)

Follow up what we will offer in this article about geometric folding algorithms linkages origami polyhedra. You know really that this book is coming as the best seller book today. So, when you are really a good reader or you're fans of the author, it does will be funny if you don't have this book. It means that you have to get this book. For you who are… (More)

- Joseph O'Rourke, Norman I. Badler
- IEEE Transactions on Pattern Analysis and Machine…
- 1979

Algorithms are presented for converting between different three-dimensional object representations: from a collection of cross section outlines to surface points, and from surface points to a collection of overlapping spheres. The algorithms effect a conversion from surface representations (outlines or surface points) to a volume representation (spheres).… (More)

- Joseph O'Rourke
- Commun. ACM
- 1981

Applications often require fitting straight lines to data that is input incrementally. The case where a data range [<italic>α<subscrpt>k</subscrpt></italic>, <italic>ω<subscrpt>k</subscrpt></italic>] is received at each <italic>t<subscrpt>k</subscrpt></italic>, <italic>t<subscrpt>1</subscrpt></italic> < <italic>t<subscrpt>2</subscrpt></italic>… (More)