The following pages link to Godfried Toussaint (Q182688):
Displaying 50 items.
- Edge-unfolding nested polyhedral bands (Q2456664) (← links)
- On polyhedra induced by point sets in space (Q2462350) (← links)
- Output-sensitive algorithms for computing nearest-neighbour decision boundaries (Q2484010) (← links)
- The Erdős--Nagy theorem and its ramifications (Q2486085) (← links)
- Feature evaluation with quadratic mutual information (Q2552385) (← links)
- Some constrained minimax and maximin location problems (Q2704991) (← links)
- Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications. (Q2704992) (← links)
- A wealth of numbers. An anthology of 500 years of popular mathematics writing (Q2884700) (← links)
- The Continuous Hexachordal Theorem (Q2914436) (← links)
- The marble frieze patterns of the cathedral of Siena: geometric structure, multi-stable perception and types of repetition (Q2920299) (← links)
- COMPUTING SIGNED PERMUTATIONS OF POLYGONS (Q3007725) (← links)
- Computing largest empty circles with location constraints (Q3039008) (← links)
- (Q3044350) (← links)
- COMPUTING SHORTEST TRANSVERSALS OF SETS (Q3136222) (← links)
- (Q3138983) (← links)
- Structural properties of Euclidean rhythms (Q3183727) (← links)
- Interlocking and Euclidean rhythms (Q3183728) (← links)
- Complexity, convexity, and unimodality (Q3219150) (← links)
- A simple linear hidden-line algorithm for star-shaped polygons (Q3219151) (← links)
- Optimal algorithms for computing the minimum distance between two finite planar sets (Q3311702) (← links)
- A new linear algorithm for triangulating monotone polygons (Q3323307) (← links)
- (Q3358207) (← links)
- (Q3514523) (← links)
- Sand drawings and Gaussian graphs§ (Q3592365) (← links)
- A counterexample to an algorithm for computing monotone hulls of simple polygons (Q3667966) (← links)
- (Q3683086) (← links)
- (Q3716329) (← links)
- (Q3716330) (← links)
- Shortest path solves edge-to-edge visibility in a polygon (Q3771676) (← links)
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (Q3776622) (← links)
- (Q3779744) (← links)
- (Q3787491) (← links)
- (Q3795225) (← links)
- (Q3799659) (← links)
- (Q3805747) (← links)
- Computing the width of a set (Q3809267) (← links)
- (Q3811771) (← links)
- Experiments in Text Recognition with the Modified Viterbi Algorithm (Q3851655) (← links)
- (Q3920971) (← links)
- A Counterexample to a Diameter Algorithm for Convex Polygons (Q3933768) (← links)
- A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets (Q3953212) (← links)
- A simple proof of Pach's extremal theorem for convex polygons (Q3959444) (← links)
- (Q3967064) (← links)
- (Q3969899) (← links)
- Anthropomorphic Polygons (Q3984347) (← links)
- (Q4036601) (← links)
- (Q4037437) (← links)
- 313. Generalisations of π: some applications (Q4043689) (← links)
- Sharper lower bounds for discrimination information in terms of variation (Corresp.) (Q4045949) (← links)
- Bibliography on estimation of misclassification (Q4057646) (← links)
