The following pages link to Godfried T. Toussaint (Q182688):
Displayed 50 items.
- Item:Q182688 (redirect page) (← links)
- Minimum many-to-many matchings for computing the distance between two sequences (Q497361) (← links)
- Computing simple circuits from a set of line segments (Q583232) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Guarding polyhedral terrains (Q676572) (← links)
- Bounded-degree polyhedronization of point sets (Q691768) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- Computing shortest transversals (Q757096) (← links)
- Item:Q182688 (redirect page) (← links)
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons (Q786507) (← links)
- The symmetric all-furthest-neighbor problem (Q789727) (← links)
- An algorithm for computing the restriction s|caffold assignment problem in computational biology (Q1041813) (← links)
- An upper bound on the probability of misclassification in terms of Matusita's measure of affinity (Q1055121) (← links)
- Finding the minimum vertex distance between two disjoint convex polygons in linear time (Q1071519) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- Fast algorithms for computing the diameter of a finite planar set (Q1104078) (← links)
- Computing the link center of a simple polygon (Q1104086) (← links)
- On geodesic properties of polygons relevant to linear time triangulation (Q1118350) (← links)
- The relative neighbourhood graph of a finite planar set (Q1141155) (← links)
- A note on linear expected time algorithms for finding convex hulls (Q1142045) (← links)
- On the multimodality of distances in convex polygons (Q1165585) (← links)
- Subjective clustering and bibliography of books on pattern recognition (Q1215414) (← links)
- On the detection of structures in noisy pictures (Q1235989) (← links)
- Some properties of Matusita's measure of affinity of several distributions (Q1243972) (← links)
- An improved algorithm to check for polygon similarity (Q1245010) (← links)
- The use of context in pattern recognition (Q1247177) (← links)
- A fast convex hull algorithm (Q1251805) (← links)
- Classification of atypical cells in the automatic cytoscreening for cervical cancer (Q1259985) (← links)
- A new look at Euclid's second proposition (Q1317510) (← links)
- Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete (Q1341680) (← links)
- A note on reconfiguring tree linkages: Trees can lock (Q1348403) (← links)
- Item:Q182688 (redirect page) (← links)
- Feasibility of design in stereolithography (Q1364363) (← links)
- Characterizing and efficiently computing quadrangulations of planar point sets (Q1389729) (← links)
- Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. (Q1395576) (← links)
- Filling polyhedral molds. (Q1401872) (← links)
- Experimental results on quadrangulations of sets of fixed points (Q1608859) (← links)
- Lower bounds for computing statistical depth. (Q1608898) (← links)
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
- A simple linear algorithm for intersecting convex polygons (Q1822240) (← links)
- Applications of a two-dimensional hidden-line algorithm to other geometric problems (Q1838318) (← links)
- Some aperture-angle optimization problems (Q1849591) (← links)
- Flipturning Polygons (Q1864190) (← links)
- Implicit convex polygons (Q1868264) (← links)
- Aperture-angle optimization problems in three dimensions (Q1868505) (← links)
- More classes of stuck unknotted hexagons (Q1878947) (← links)
- Geometric and computational aspects of gravity casting (Q1902403) (← links)
- All convex polyhedra can be clamped with parallel jaw grippers (Q1924713) (← links)
- Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
- On the separability of quadrilaterals in the plane by translations and rotations (Q2400117) (← links)