Year |
Citation |
Score |
2017 |
Yousefi S, Chang X, Wymeersch H, Champagne B, Toussaint G. A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane Computational Optimization and Applications. 69: 383-402. DOI: 10.1007/S10589-017-9952-3 |
0.44 |
|
2014 |
Toussaint G. Applications Of The Rotating Calipers To Geometric Problems In Two And Three Dimensions International Journal of Digital Information and Wireless Communications. 4: 372-386. DOI: 10.17781/P001290 |
0.346 |
|
2014 |
Mohamad M, Rappaport D, Toussaint G. Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Graphs and Combinatorics. 31: 1637-1648. DOI: 10.1007/S00373-014-1467-4 |
0.453 |
|
2013 |
Mukhopadhyay A, Drouillard C, Toussaint G. Guarding simple polygons with semi-open edge guards 3rd International Conference On Digital Information Processing and Communications, Icdipc 2013. 417-422. |
0.31 |
|
2011 |
Tóth CD, Toussaint G, Winslow A. Open guard edges and edge guards in simple polygons Proceedings of the 23rd Annual Canadian Conference On Computational Geometry, Cccg 2011. |
0.328 |
|
2010 |
Toussaint G. Computational geometric aspects of rhythm, melody, and voice-leading Computational Geometry: Theory and Applications. 43: 2-22. DOI: 10.1016/J.Comgeo.2007.01.003 |
0.34 |
|
2007 |
Colannino J, Toussaint G. Corrigendum to "An algorithm for computing the restriction Scaffold assignment problem in computational biology" [Inform. Process. Lett. 95 (4) (2005) 466-471] (DOI:10.1016/j.ipl.2005.05.007) Information Processing Letters. 103: 44. DOI: 10.1016/J.Ipl.2006.12.014 |
0.405 |
|
2007 |
Colannino J, Damian M, Hurtado F, Langerman S, Meijer H, Ramaswami S, Souvaine D, Toussaint G. Efficient Many-To-Many Point Matching in One Dimension Graphs and Combinatorics. 23: 169-178. DOI: 10.1007/S00373-007-0714-3 |
0.376 |
|
2006 |
Colannino J, Damian M, Hurtado F, Iacono J, Meijer H, Ramaswami S, Toussaint G. An O(n log n)-time algorithm for the restriction scaffold assignment problem. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 13: 979-89. PMID 16761922 DOI: 10.1089/Cmb.2006.13.979 |
0.329 |
|
2006 |
Aloupis G, Fevens T, Langerman S, Matsui T, Mesa A, Nuñez Y, Rappaport D, Toussaint G. Algorithms for Computing Geometric Measures of Melodic Similarity Computer Music Journal. 30: 67-76. DOI: 10.1162/Comj.2006.30.3.67 |
0.302 |
|
2005 |
Colannino J, Toussaint G. An algorithm for computing the restriction scaffold assignment problem in computational biology Information Processing Letters. 95: 466-471. DOI: 10.1016/J.Ipl.2005.05.007 |
0.43 |
|
2005 |
Toussaint G. The Erdös-Nagy theorem and its ramifications Computational Geometry: Theory and Applications. 31: 219-236. DOI: 10.1016/J.Comgeo.2004.12.005 |
0.502 |
|
2004 |
Brönnimann H, Iacono J, Katajainen J, Morin P, Morrison J, Toussaint G. Space-efficient planar convex hull algorithms Theoretical Computer Science. 321: 25-40. DOI: 10.1016/J.Tcs.2003.05.004 |
0.419 |
|
2003 |
Toussaint G. Simple proofs of a geometric property of four-bar linkages American Mathematical Monthly. 110: 482-494. DOI: 10.2307/3647904 |
0.318 |
|
2003 |
SellarÈs JA, Toussaint G. On the role of kinesthetic thinking in computational geometry International Journal of Mathematical Education in Science and Technology. 34: 219-237. DOI: 10.1080/0020739031000071511 |
0.435 |
|
2002 |
Aloupis G, Cortés C, Gómez F, Soss M, Toussaint G. Lower bounds for computing statistical depth Computational Statistics & Data Analysis. 40: 223-229. DOI: 10.1016/S0167-9473(02)00032-4 |
0.669 |
|
2002 |
Bose P, Ramaswami S, Toussaint G, Turki A. Experimental results on quadrangulations of sets of fixed points Computer Aided Geometric Design. 19: 533-552. DOI: 10.1016/S0167-8396(02)00133-4 |
0.373 |
|
2002 |
Gómez F, Ramaswami S, Toussaint G. On computing general position views of data in three dimensions Journal of Visual Communication and Image Representation. 13: 401-424. DOI: 10.1006/Jvci.2001.0503 |
0.475 |
|
2001 |
Toussaint G, Soss MA. Geometric and computational aspects of molecular reconfiguration Journal of Mathematical Chemistry. 27: 303-318. DOI: 10.1023/A:1018823806289 |
0.662 |
|
2001 |
Calvo JA, Krizanc D, Morin P, Soss M, Toussaint G. Convexifying polygons with simple projections Information Processing Letters. 80: 81-86. DOI: 10.1016/S0020-0190(01)00150-8 |
0.656 |
|
2001 |
Biedl T, Demaine E, Demaine M, Lazard S, Lubiw A, O'rourke J, Overmars M, Robbins S, Streinu I, Toussaint G, Whitesides S. Locked and Unlocked Polygonal Chains in Three Dimensions Discrete and Computational Geometry. 26: 269-281. DOI: 10.1007/S00454-001-0038-7 |
0.472 |
|
2001 |
Gómez F, Hurtado F, Sellarès JA, Toussaint G. Nice perspective projections Journal of Visual Communication and Image Representation. 12: 387-400. DOI: 10.1006/Jvci.2001.0488 |
0.392 |
|
2000 |
Soss M, Toussaint GT. Geometric and computational aspects of polymer reconfiguration Journal of Mathematical Chemistry. 27: 303-318. |
0.378 |
|
1998 |
Ramaswamia S, Ramos P, Toussaint G. Converting triangulations to quadrangulations Computational Geometry: Theory and Applications. 9: 257-276. DOI: 10.1016/S0925-7721(97)00019-9 |
0.46 |
|
1998 |
Bose P, Van Kreveld M, Toussaint G. Filling polyhedral molds Cad Computer Aided Design. 30: 245-254. |
0.318 |
|
1997 |
Bose P, Toussaint G. Characterizing and efficiently computing quadrangulations of planar point sets Computer Aided Geometric Design. 14: 763-785. DOI: 10.1016/S0167-8396(97)00013-7 |
0.496 |
|
1997 |
Bose P, Shermer T, Toussaint G, Zhu B. Guarding polyhedral terrains Computational Geometry. 7: 173-185. DOI: 10.1016/0925-7721(95)00034-8 |
0.437 |
|
1997 |
Gómez F, Ramaswami S, Toussaint G. On removing non-degeneracy assumptions in computational geometry: (Extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1203: 86-99. DOI: 10.1007/3-540-62592-5_63 |
0.401 |
|
1996 |
Bose P, Bremner D, Toussaint G. All convex polyhedra can be clamped with parallel jaw grippers Computational Geometry: Theory and Applications. 6: 291-302. DOI: 10.1016/0925-7721(95)00052-6 |
0.398 |
|
1996 |
Bose P, Ramos P, Gomez F, Toussaint G. Drawing nice projections of objects in space Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1027: 52-63. DOI: 10.1006/Jvci.1999.0415 |
0.418 |
|
1996 |
Eu D, Guévremont E, Toussaint GT. On Envelopes of Arrangements of Lines Journal of Algorithms. 21: 111-148. DOI: 10.1006/jagm.1996.0040 |
0.305 |
|
1995 |
Bose P, Toussaint G. Geometric and computational aspects of gravity casting Computer-Aided Design. 27: 455-464. DOI: 10.1016/0010-4485(95)00018-M |
0.309 |
|
1995 |
Bose P, Toussaint G. Growing a Tree from Its Branches Journal of Algorithms. 19: 86-103. DOI: 10.1006/Jagm.1995.1028 |
0.362 |
|
1995 |
Bose P, Toussaint G. No Quadrangulation is extremely odd Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1004: 372-381. |
0.32 |
|
1994 |
Eu D, Toussaint GT. On Approximating Polygonal Curves in Two and Three Dimensions Graphical Models and Image Processing. 56: 231-246. DOI: 10.1006/gmip.1994.1022 |
0.32 |
|
1993 |
ElGindy H, Everett H, Toussaint G. Slicing an ear using prune-and-search Pattern Recognition Letters. 14: 719-722. DOI: 10.1016/0167-8655(93)90141-Y |
0.346 |
|
1993 |
Toussaint G. A new look at euclid's second proposition The Mathematical Intelligencer. 15: 12-24. DOI: 10.1007/Bf03024252 |
0.412 |
|
1993 |
Devroye L, Toussaint G. Convex Hulls for Random Lines Journal of Algorithms. 14: 381-394. DOI: 10.1006/Jagm.1993.1020 |
0.426 |
|
1991 |
Toussaint G. A counter-example to a convex hull algorithm for polygons Pattern Recognition. 24: 183-184. DOI: 10.1016/0031-3203(91)90087-L |
0.454 |
|
1991 |
Bhattacharya B, Toussaint G. Computing shortest transversals Computing. 46: 93-119. DOI: 10.1007/Bf02239165 |
0.449 |
|
1991 |
Toussaint G. Efficient triangulation of simple polygons The Visual Computer. 7: 280-295. DOI: 10.1007/BF01905693 |
0.367 |
|
1990 |
Kong X, Everett H, Toussaint G. The Graham scan triangulates simple polygons Pattern Recognition Letters. 11: 713-716. DOI: 10.1016/0167-8655(90)90089-K |
0.49 |
|
1990 |
Samuel D, Toussaint GT. Computing the external geodesic diameter of a simple polygon Computing. 44: 1-19. DOI: 10.1007/BF02247961 |
0.38 |
|
1989 |
Toussaint G. On separating two simple polygons by a single translation Discrete &Amp; Computational Geometry. 4: 265-278. DOI: 10.1007/Bf02187729 |
0.394 |
|
1989 |
ElGindy H, Toussaint GT. On geodesic properties of polygons relevant to linear time triangulation The Visual Computer. 5: 68-74. DOI: 10.1007/BF01901482 |
0.356 |
|
1988 |
Bhattacharya BK, Toussaint GT. Fast algorithms for computing the diameter of a finite planar set The Visual Computer. 3: 379-388. DOI: 10.1007/BF01901195 |
0.376 |
|
1987 |
Sack JR, Toussaint GT. Separability of pairs of polygons through single translations Robotica. 5: 55-63. DOI: 10.1017/S0263574700009644 |
0.306 |
|
1986 |
Toussaint GT. A linear-time algorithm for solving the strong hidden-line problem in a simple polygon Pattern Recognition Letters. 4: 449-451. DOI: 10.1016/0167-8655(86)90043-7 |
0.367 |
|
1986 |
Avis D, Gum T, Toussaint G. Visibility between two edges of a simple polygon The Visual Computer. 2: 342-357. DOI: 10.1007/BF01952419 |
0.376 |
|
1985 |
Rappaport D, Toussaint GT. A simple linear hidden-line algorithm for star-shaped polygons Pattern Recognition Letters. 3: 35-39. DOI: 10.1016/0167-8655(85)90040-6 |
0.319 |
|
1985 |
McQueen MM, Toussaint GT. On the ultimate convex hull algorithm in practice Pattern Recognition Letters. 3: 29-34. DOI: 10.1016/0167-8655(85)90039-X |
0.339 |
|
1985 |
Toussaint GT. A historical note on convex hull finding algorithms Pattern Recognition Letters. 3: 21-28. DOI: 10.1016/0167-8655(85)90038-8 |
0.387 |
|
1985 |
Toussaint GT. A simple linear algorithm for intersecting convex polygons The Visual Computer. 1: 118-123. DOI: 10.1007/BF01898355 |
0.364 |
|
1984 |
Toussaint GT. A new linear algorithm for triangulating monotone polygons Pattern Recognition Letters. 2: 155-158. DOI: 10.1016/0167-8655(84)90039-4 |
0.302 |
|
1984 |
Toussaint GT. Complexity, convexity, and unimodality International Journal of Computer &Amp; Information Sciences. 13: 197-217. DOI: 10.1007/BF00979872 |
0.366 |
|
1983 |
Toussaint GT. The symmetric all-furthest- neighbor problem Computers and Mathematics With Applications. 9: 747-754. DOI: 10.1016/0898-1221(83)90139-6 |
0.345 |
|
1983 |
Bhattacharya B, Toussaint G. Time- and storage-efficient implementation of an optimal planar convex hull algorithm Image and Vision Computing. 1: 140-144. DOI: 10.1016/0262-8856(83)90065-3 |
0.324 |
|
1983 |
Bhattacharya BK, Toussaint GT. Efficient algorithms for computing the maximum distance between two finite planar sets Journal of Algorithms. 4: 121-136. DOI: 10.1016/0196-6774(83)90040-8 |
0.361 |
|
1983 |
Toussaint GT, Bhattacharya BK. Optimal algorithms for computing the minimum distance between two finite planar sets Pattern Recognition Letters. 2: 79-82. DOI: 10.1016/0167-8655(83)90041-7 |
0.346 |
|
1983 |
Toussaint GT. On the application of the convex hull to histogram analysis in threshold selection Pattern Recognition Letters. 2: 75-77. DOI: 10.1016/0167-8655(83)90040-5 |
0.347 |
|
1983 |
Toussaint GT, El Gindy H. A counterexample to an algorithm for computing monotone hulls of simple polygons Pattern Recognition Letters. 1: 219-222. DOI: 10.1016/0167-8655(83)90028-4 |
0.355 |
|
1983 |
ElGindy H, Avis D, Toussaint G. Applications of a two-dimensional hidden-line algorithm to other geometric problems Computing. 31: 191-202. DOI: 10.1007/BF02263430 |
0.346 |
|
1983 |
Toussaint GT. Computing largest empty circles with location constraints International Journal of Computer &Amp; Information Sciences. 12: 347-358. DOI: 10.1007/BF01008046 |
0.323 |
|
1982 |
Bhattacharya BK, Toussaint GT. A Counterexample to a Diameter Algorithm for Convex Polygons Ieee Transactions On Pattern Analysis and Machine Intelligence. 306-309. DOI: 10.1109/TPAMI.1982.4767248 |
0.362 |
|
1982 |
Toussaint GT, McAlear JA. A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets Pattern Recognition Letters. 1: 21-24. DOI: 10.1016/0167-8655(82)90046-0 |
0.333 |
|
1982 |
Toussaint GT, Avis D. On a convex hull algorithm for polygons and its application to triangulation problems Pattern Recognition. 15: 23-29. DOI: 10.1016/0031-3203(82)90057-7 |
0.358 |
|
1981 |
Avis D, Toussaint GT. An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge Ieee Transactions On Computers. 910-914. DOI: 10.1109/TC.1981.1675729 |
0.328 |
|
1981 |
Avis D, Toussaint GT. An efficient algorithm for decomposing a polygon into star-shaped polygons Pattern Recognition. 13: 395-398. DOI: 10.1016/0031-3203(81)90002-9 |
0.356 |
|
1981 |
Devroye L, Toussaint GT. A note on linear expected time algorithms for finding convex hulls Computing. 26: 361-366. DOI: 10.1007/Bf02237955 |
0.35 |
|
1980 |
Toussaint GT. The relative neighbourhood graph of a finite planar set Pattern Recognition. 12: 261-268. DOI: 10.1016/0031-3203(80)90066-7 |
0.398 |
|
1980 |
Toussaint GT. ALGORITHMS FOR COMPUTING RELATIVE NEIGHBOURHOOD GRAPH Electronics Letters. 16. |
0.361 |
|
1978 |
Akl SG, Toussaint GT. A fast convex hull algorithm Information Processing Letters. 7: 219-222. DOI: 10.1016/0020-0190(78)90003-0 |
0.306 |
|
Show low-probability matches. |