|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1231 occurrences of 767 keywords
|
|
|
Results
Found 2673 publication records. Showing 2673 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
30 | Hubert Wagener |
Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 593-599, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
visibility region, subchain hull queries, data structure, convex hull, runtime, simple polygons, simple polygon, CRCW-PRAM, optimal parallel algorithm |
30 | Frank Hoffmann 0002, Michael Kaufmann 0001, Klaus Kriegel |
The Art Gallery Theorem for Polygons With Holes ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 39-48, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
art gallery theorem, polygons with holes, graph-theoretic formulation, complexity analysis, open problems |
30 | Mihran Tüceryan, Anil K. Jain 0001 |
Texture Segmentation Using Voronoi Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(2), pp. 211-216, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
Voronoi polygons, probabilistic relaxation labeling, pattern recognition, pattern recognition, computational geometry, picture processing, picture processing, tokens, texture segmentation, textured image, Voronoi tessellation |
30 | Joseph C. Culberson, Robert A. Reckhow |
Covering Polygons Is Hard (Preliminary Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 601-611, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
minimum cover problems, arbitrary polygon, orthogonal polygon, NP-hard, boundary, covering problems, convex polygons, rectangles |
30 | Teofilo F. Gonzalez, Si-Qing Zheng |
Bounds for partitioning rectilinear polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985, pp. 281-287, 1985, ACM, 0-89791-163-6. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
approximation algrithms, partition of rectilinear polygons, polynomial time complexity |
28 | Charles Audet, Pierre Hansen, Frédéric Messine |
Isoperimetric Polygons of Maximum Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(1), pp. 45-60, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Reuleaux, Polygon, Convex polygon, Width, Perimeter |
28 | Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda |
Algorithms for Computing Diffuse Reflection Paths in Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 47-58, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Deepti Joshi, Ashok Samal, Leen-Kiat Soh |
Density-based clustering of polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIDM ![In: Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009, part of the IEEE Symposium Series on Computational Intelligence 2009, Nashville, TN, USA, March 30, 2009 - April 2, 2009, pp. 171-178, 2009, IEEE, 978-1-4244-2765-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Alexey Lvov, Ulrich Finkler |
Exact basic geometric operations on arbitrary angle polygons using only fixed size integer coordinates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2008 International Conference on Computer-Aided Design, ICCAD 2008, San Jose, CA, USA, November 10-13, 2008, pp. 494-498, 2008, IEEE Computer Society, 978-1-4244-2820-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Rodrigo I. Silveira, Marc J. van Kreveld |
Optimal Higher Order Delaunay Triangulations of Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 133-145, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Kevin Iga, Randall Maddox |
Pebble Sets in Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(4), pp. 680-700, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Eduard Oks, Micha Sharir |
Minkowski Sums of Monotone and General Simple Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 35(2), pp. 223-240, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Ömer M. Soysal, Bahadir K. Gunturk, Kenneth L. Matthews II |
Image Retrieval using Canonical Cyclic String Representation of Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings of the International Conference on Image Processing, ICIP 2006, October 8-11, Atlanta, Georgia, USA, pp. 1493-1496, 2006, IEEE, 1-4244-0480-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann, Csaba D. Tóth |
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 86-97, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Zhenyu Liu, Dimitrios A. Pados |
LDPC codes from generalized polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(11), pp. 3890-3898, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Bengt J. Nilsson |
Approximate Guarding of Monotone and Rectilinear Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 1362-1373, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Alireza Zarei, Mohammad Ghodsi |
Efficient computation of query point visibility in polygons with holes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 314-320, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
polygon with holes, visibility decomposition, visibility polygon |
28 | Xuehou Tan |
Approximation Algorithms for Cutting Out Polygons with Lines and Rays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 534-543, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Pavel Pech |
Computations of the Area and Radius of Cyclic Polygons Given by the Lengths of Sides. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Automated Deduction in Geometry ![In: Automated Deduction in Geometry, 5th International Workshop, ADG 2004, Gainesville, FL, USA, September 16-18, 2004, Revised Papers, pp. 44-58, 2004, Springer, 3-540-31332-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Khanh P. V. Doan |
Antialiased Rendering of Self-Intersecting Polygons using Polygon Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PG ![In: 12th Pacific Conference on Computer Graphics and Applications, PG 2004, Seoul, South Korea, October 6-8, 2004, pp. 383-391, 2004, IEEE Computer Society, 0-7695-2234-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Jin Akiyama, Koichi Hirata, Mari-Jo P. Ruiz, Jorge Urrutia |
Flat 2-Foldings of Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCCGGT ![In: Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers, pp. 14-24, 2003, Springer, 3-540-24401-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Toshinori Sakai, Chie Nara, Jorge Urrutia |
Equal Area Polygons in Convex Bodies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCCGGT ![In: Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers, pp. 146-158, 2003, Springer, 3-540-24401-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang 0001 |
Visibility Queries and Maintenance in Simple Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 27(4), pp. 461-483, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Ren Ding, Kiyoshi Hosono, Masatsugu Urabe, Changqing Xu |
Partitioning a Planar Point Set into Empty Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers, pp. 129-134, 2002, Springer, 3-540-20776-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Stephan J. Eidenbenz |
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 60-68, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer |
Inapproximability Results for Guarding Polygons and Terrains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 31(1), pp. 79-113, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Xuehou Tan |
Finding an Optimal Bridge between Two Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 170-180, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Noel Cressie, Hal S. Stern, Deanne Reber Wright |
Mapping rates associated with polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Geogr. Syst. ![In: J. Geogr. Syst. 2(1), pp. 61-69, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Basilios Gatos, S. L. Mantzaris |
A Novel Recursive Algorithm for Area Location Using Isothetic Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR ![In: 15th International Conference on Pattern Recognition, ICPR'00, Barcelona, Spain, September 3-8, 2000., pp. 3496-3499, 2000, IEEE Computer Society, 0-7695-0750-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang 0001 |
Visibility Queries in Simple Polygons and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 357-366, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Subir Kumar Ghosh |
On Recognizing and Characterizing Visibility Graphs of Simple Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 17(2), pp. 143-162, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Peter Damaschke |
An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, pp. 570-581, 1995, Springer, 3-540-60313-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
28 | W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee |
Minimum rectangular partition problem for simple rectilinear polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(7), pp. 720-733, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
28 | Helmut Alt, Johannes Blömer, Hubert Wagener |
Approximation of Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings, pp. 703-716, 1990, Springer, 3-540-52826-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
28 | Paul J. Heffernan, Joseph S. B. Mitchell |
Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990, pp. 53-62, 1990, ACM, 0-89791-362-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
28 | Amitava Datta, G. D. S. Ramkumar |
On Some Largest Empty Orthoconvex Polygons in a Point Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings, pp. 270-285, 1990, Springer, 3-540-53487-3. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
28 | Thomas Roos |
k-Nearest-Neighbor Voronoi Diagrams for Sets of Convex Polygons, Line Segments and Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings, pp. 330-340, 1989, Springer, 3-540-52292-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
28 | Hans Rohnert |
Moving Discs Between Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 502-515, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
polygonal obstacles, computational geometry, Motion Planning |
28 | Subir Kumar Ghosh |
On Recognizing and Characterizing Visibility Graphs of Simple Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings, pp. 96-104, 1988, Springer, 3-540-19487-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
28 | Christos Levcopoulos |
Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986, pp. 100-108, 1986, ACM, 0-89791-194-6. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
28 | Andrzej Lingas |
On partitioning polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985, pp. 288-295, 1985, ACM, 0-89791-163-6. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
28 | Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap |
Finding minimal convex nested polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985, pp. 296-304, 1985, ACM, 0-89791-163-6. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
28 | Jörg-Rüdiger Sack, Godfried T. Toussaint |
Translating Polygons in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings, pp. 310-321, 1985, Springer, 3-540-13912-5. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
25 | Bart Kuijpers, Bart Moelans, Nico Van de Weghe |
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIS ![In: 14th ACM International Symposium on Geographic Information Systems, ACM-GIS 2006, November 10-11, 2006, Arlington, Virginia, USA, Proceedings, pp. 11-18, 2006, ACM, 1-59593-529-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
double-cross calculus, qualitative calculi, classification, indexing, similarity, polygons, query-by-sketch, polylines |
25 | Marina L. Gavrilova |
Two Map Labeling Algorithms for GIS Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I, pp. 61-70, 2006, Springer, 3-540-34070-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
map labeling for polygons with holes, polygonal area removal, sweep algorithm, set of maximum inscribed rectangles, GIS |
25 | Jin-Liang Chen, Jing-Sin Liu, Wan-Chi Lee |
A Recursive Algorithm for On-line Clustering Obstacles Cluttered in Dynamic Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 33(2), pp. 209-230, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
clustering, collision detection, dynamic environment, on-line, convex polygons |
25 | Siew Kei Lam, Thambipillai Srikanthan |
High-Speed Environment Representation Scheme for Dynamic Path Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 32(3), pp. 307-319, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
environment representation, VLSI, convex polygons, visibility graph, robot path-planning |
25 | Xuan Liu, Shashi Shekhar, Sanjay Chawla |
Consistency checking for Euclidean spatial constraints: a dimension graph approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 13-15 November 2000, Vancouver, BC, Canada, pp. 333-, 2000, IEEE Computer Society, 0-7695-0909-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Euclidean spatial constraints, dimension graph approach, graph cycle detection, spatial predicates, two-dimensional space, computational complexity, computational geometry, transforms, polygons, consistency checking, intervals, space complexity, spatial objects |
25 | Stanislav Sheynin, Alexander Tuzikov, Denis Volgin |
Computation of Symmetry Measures for Polygonal Shapes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAIP ![In: Computer Analysis of Images and Patterns, 8th International Conference, CAIP'99, Ljubljana, Slovenia, September 1-3, 1999, Proceedings, pp. 183-190, 1999, Springer, 3-540-66366-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
polygons, symmetry measures |
25 | Tamal K. Dey |
Improved Bounds on Planar k-sets and k-levels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 156-161, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
planar k-sets, k-levels, parametric minimum spanning trees, parametric matroids, computational complexity, line segments, combinatorial complexities, convex polygons |
25 | Robert P. Futrelle, Nikos Nikolakis |
Efficient analysis of complex diagrams using constraint-based parsing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume II, pp. 782-790, 1995, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
complex diagrams, constraint-based parsing, constraint grammars, graphics primitives, vectorized diagrams, genetic diagrams, finite state automata diagrams, Macintosh Common Lisp, Macintosh Quadra 700, finite automata, polygons, lines, spatial indexing, electronic documents, circles, Bezier curves |
25 | Berrin A. Yanikoglu, Luc Vincent |
Ground-truthing and benchmarking document page segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume II, pp. 601-604, 1995, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
document page segmentation, OCR output, region-based method, region misclassifications, region splitting, segmentation quality, headline detection, retyping, GroundsKeeper, document view, arbitrary polygons, benchmarking, customization, document image processing, errors, X-Window, image regions, ground-truthing, region merging |
25 | Ann Bengtsson, Jan-Olof Eklundh |
Shape Representation by Multiscale Contour Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 13(1), pp. 85-93, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
scale stability, multiscale contour approximation, qualitative descriptions, straight arcs, curved arcs, points delimiting the arcs, inflexion points, scale-space property of causality, computer vision, computerised picture processing, computerised pattern recognition, polygons, shape representation, corners |
25 | Paul Fischer, Hans Ulrich Simon |
Separation Problems and Circular Arc Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG '90, Berlin, Germany, June 20-22, 1990, Proceedings, pp. 251-259, 1990, Springer, 3-540-53832-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
separating polygons, separating planar subdivisions, circular arc systems, number of stages, computational geometry, visibility, transversals, intersection graphs, computational learning |
25 | Michael E. Houle, Godfried T. Toussaint |
Computing the Width of a Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 10(5), pp. 761-765, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
parallel planes, pattern recognition, pattern recognition, computational complexity, computational complexity, computational geometry, computational geometry, time complexity, convex hull, set theory, polygons, point sets, 3D space |
25 | David P. Dobkin, Leonidas J. Guibas, John Hershberger 0001, Jack Snoeyink |
An efficient algorithm for finding the CSG representation of a simple polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 15th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1988, Atlanta, Georgia, USA, August 1-5, 1988, pp. 31-40, 1988, ACM, 0-89791-275-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
boundary-to-CSG conversion algorithms, solid modeling, constructive solid geometry, simple polygons |
25 | Christian Bingane |
Tight Bounds on the Maximal Area of Small Polygons: Improved Mossinghoff Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 70(1), pp. 236-248, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Christoph Koutschan, Anton Ponomarchuk, Josef Schicho |
Approximation of convex polygons by polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SYNASC ![In: 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2021, Timisoara, Romania, December 7-10, 2021, pp. 91-98, 2021, IEEE, 978-1-6654-0650-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | R. Inkulu, K. Sowmya, Nitish P. Thakur |
Dynamic Algorithms for Visibility Polygons in Simple Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Geom. Appl. ![In: Int. J. Comput. Geom. Appl. 30(1), pp. 51-78, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu |
Covering Polygons by Min-Area Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1912.03429, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Hossein Boomari, Mojtaba Ostovari, Alireza Zarei |
Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.05105, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
25 | Chenglei Yang, Weizhen Wang, Yi-Jun Yang, Lin Lu, Zhi-Jie Zhu, Binhai Zhu, Wei Zeng 0002 |
Weak visibility polygons of NURBS curves inside simple polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Appl. Math. ![In: J. Comput. Appl. Math. 256, pp. 1-15, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Andrzej Zak |
Dissections of Polygons into Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Geom. Appl. ![In: Int. J. Comput. Geom. Appl. 20(2), pp. 223-244, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Gabriele Bianchi |
The cross covariogram of a pair of polygons determines both polygons, with a few exceptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 42(4), pp. 519-544, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski |
Note on covering monotone orthogonal polygons with star-shaped polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 104(6), pp. 220-227, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Bart De Bruyn, Pieter Vandecasteele |
Near polygons with a nice chain of sub-near polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 108(2), pp. 297-311, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Jin Akiyama, Gisaku Nakamura |
Determination of All Convex Polygons which are Chameleons-Congruent Dudeney Dissections of Polygons-. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5), pp. 978-986, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
25 | Yukio Sadahiro |
Number of Polygons Generated by Map Overlay: The Case of Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. GIS ![In: Trans. GIS 5(4), pp. 345-353, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Laxmi P. Gewali, J. Mark Keil, Simeon C. Ntafos |
On covering orthogonal polygons with star-shaped polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 65(1-2), pp. 45-63, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
25 | Robon Liu, Simeon C. Ntafos |
On Partitioning Rectilinear Polygons into Star-Shaped Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 6(6), pp. 771-800, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
25 | Rajeev Motwani 0001, Arvind Raghunathan, Huzur Saran |
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 40(1), pp. 19-48, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
25 | John F. McIntosh |
The interactive digitizing of polygons and the processing of polygons in a relational database. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 5th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1978, Atlanta, GA, USA, August 23-25, 1978, pp. 60-63, 1978, ACM, 978-1-4503-7908-3. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
23 | Gaiane Panina, Ileana Streinu |
Flattening single-vertex origami: the non-expansive case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 306-313, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
expansive motion, spherical geometry, computational geometry, folding, origami, pseudo-triangulation |
23 | Alexei N. Skurikhin |
Proximity Graphs Based Multi-scale Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVC (1) ![In: Advances in Visual Computing, 4th International Symposium, ISVC 2008, Las Vegas, NV, USA, December 1-3, 2008. Proceedings, Part I, pp. 298-307, 2008, Springer, 978-3-540-89638-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Shinichi Fukushige, Hiromasa Suzuki |
Polygon visibility ordering via Voronoi diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 23(7), pp. 503-511, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Voronoi diagrams, Visibility determination, Visibility ordering, Space subdivision, Priority algorithm |
23 | William W. Hargrove, Forrest M. Hoffman, Paul F. Hessburg |
Mapcurves: a quantitative method for comparing categorical maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Geogr. Syst. ![In: J. Geogr. Syst. 8(2), pp. 187-208, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Ecoregion, Kappa statistic, Landcover, Spatial concordance, Spatial uncertainty, Vegetation, Model validation, Overlap, Goodness-of-fit |
23 | Michael Kortenjan, Gunnar Schomaker |
Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Afrigraph ![In: Proceedings of the 4th International Conference on Virtual Reality, Computer Graphics, Visualisation and Interaction in Africa, Afrigraph 2006, Cape Town, South Africa, January 25-27, 2006, pp. 107-116, 2006, ACM, 1-59593-288-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
clustering, spatial data structures, rendering systems, level of detail algorithms |
23 | Subramaniam Ganesan, Kenneth Ong |
Mesh simplification using ellipsoidal schema for isotropic quantization of face-normal vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APVIS ![In: Asia-Pacific Symposium on Information Visualisation, APVIS 2006, Tokyo, Japan, February 1-3, 2006, pp. 31-34, 2006, Australian Computer Society, 1-920682-41-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
ellipsoidal schema, isotropic quantization, mesh simplification, codebook |
23 | Xiaqing Wu, John K. Johnstone |
Delaunay-Based Polygon Morphing Across a Change in Topology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I, pp. 500-509, 2006, Springer, 3-540-34070-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Yuan-Yu Tsai, Chung-Ming Wang, Chung-Hsien Chang, Yu-Ming Cheng |
Tunable Bounding Volumes for Monte Carlo Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I, pp. 171-180, 2006, Springer, 3-540-34070-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Shinichi Fukushige, Hiromasa Suzuki |
Voronoi diagram depth sorting for polygon visibility ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GRAPHITE ![In: Proceedings of the 4th International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia 2006, Kuala Lumpur, Malaysia, November 29 - December 2, 2006, pp. 461-467, 2006, ACM, 1-59593-564-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
depth sorting, transparency rendering, Voronoi diagram, visibility determination |
23 | Takashi Terashima, Hiroshi Shimanuki, Jien Kato, Toyohide Watanabe |
Method for Representing 3-D Virtual Origami. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Eighth International Conference on Document Analysis and Recognition (ICDAR 2005), 29 August - 1 September 2005, Seoul, Korea, pp. 1211-1215, 2005, IEEE Computer Society, 0-7695-2420-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Daniel Méneveaux, Kadi Bouatouch, Gilles Subrenat, Philippe Blasi |
Efficient clustering and visibility calculation for global illumination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Afrigraph ![In: Proceedings of the 2nd International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa, Afrigraph 2003, Cape Town, South Africa, February 3-5, 2003, pp. 87-94, 2003, ACM, 1-58113-643-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
architectural environments, clustering, global illumination, visibility |
23 | Chris Joslin, Nadia Magnenat-Thalmann |
Significant facet retrieval for real-time 3D sound rendering in complex virtual environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VRST ![In: Proceedings of the ACM Symposium on Virtual Reality Software and Technology, VRST 2003, Osaka, Japan, October 1-3, 2003, pp. 15-21, 2003, ACM, 1-58113-569-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
sound rendering, virtual environments, scene segmentation, bounding-box |
23 | Jan Klein 0001, Gabriel Zachmann |
Time-critical collision detection using an average-case approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VRST ![In: Proceedings of the ACM Symposium on Virtual Reality Software and Technology, VRST 2003, Osaka, Japan, October 1-3, 2003, pp. 22-31, 2003, ACM, 1-58113-569-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
average-case algorithms, bounding volume trees, probabilistic analysis, virtual prototyping, hierarchical data structures, interference detection, hierarchical partitioning |
23 | Tong-Yee Lee, Ping-Hsien Lin, Tz-Hsien Yang |
A Hybrid Scheme for Interactive Rendering a Virtual Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2003, International Conference, Montreal, Canada, May 18-21, 2003, Proceedings, Part III, pp. 285-294, 2003, Springer, 3-540-40156-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Ross Brown 0001, Luke Cooper, Binh Pham 0001 |
Visual attention-based polygon level of detail management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GRAPHITE ![In: Proceedings of the 1st International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia 2003, Melbourne, Australia, February 11-14, 2003, pp. 55-62, 2003, ACM, 1-58113-578-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
level of detail management, visual attention, real-time graphics |
23 | Kenjiro T. Miura 0001, Hiroshi Masuda |
Selective Non-Uniform Subdivision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PG ![In: 10th Pacific Conference on Computer Graphics and Applications, PG 2002, Beijing, China, October 9-11, 2002, pp. 457-459, 2002, IEEE Computer Society, 0-7695-1784-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Jairo Rocha |
Polygon Partition into Stable Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAGM-Symposium ![In: Pattern Recognition, 24th DAGM Symposium, Zurich, Switzerland, September 16-18, 2002, Proceedings, pp. 83-90, 2002, Springer, 3-540-44209-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Steven A. Roberts, G. Brent Hall, Paul H. Calamai |
Assessing polygon edge integrity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Geogr. Syst. ![In: J. Geogr. Syst. 3(1), pp. 87-105, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Alan Saalfeld |
Area-preserving piecewise affine mappings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001, pp. 90-95, 2001, ACM, 1-58113-357-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
authalic transformations, piecewise affine homemorphisms |
23 | Yuefeng Zhang, Yu Huang |
Wavelet shape blending. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 16(2), pp. 106-115, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Algorithm, Animation, Wavelet transform, Shape blending |
23 | Takayuki Itoh, Yasushi Yamaguchi 0001, Koji Koyamada |
Fast Isosurface Generation Using the Cell-Edge Centered Propagation Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISHPC ![In: High Performance Computing, Third International Symposium, ISHPC 2000, Tokyo, Japan, October 16-18, 2000. Proceedings, pp. 547-556, 2000, Springer, 3-540-41128-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | A. Schubert |
Detection and Tracking of Facial Features in Real Time Using a Synergistic Approach of Spatio-Temporal Models and Generalized Hough-Transform Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FG ![In: 4th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2000), 26-30 March 2000, Grenoble, France, pp. 116-121, 2000, IEEE Computer Society, 0-7695-0580-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Harlen Costa Batagelo, Ilaim Costa Júnior |
Real-Time Shadow Generation Using BSP Trees and Stencil Buffers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIBGRAPI ![In: XII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI '99), October 17-20, 1999, Campinas, Brazil, pp. 93-, 1999, IEEE Computer Society, 0-7695-0481-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Stencil Buffers, Shadows, BSP Trees |
23 | Robert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák |
Visibility Representations of Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings, pp. 333-340, 1999, Springer, 3-540-66904-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Eric Rémila |
Tiling Groups: New Applications in the Triangular Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 20(2), pp. 189-204, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Danny Z. Chen |
Efficient Geometric Algorithms on the EREW PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 6(1), pp. 41-47, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Joseph S. B. Mitchell, Subhash Suri |
Separation and Approximation of Polyhedral Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 296-306, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
23 | Jean-Marc Robert 0001, Godfried T. Toussaint |
Linear Approximation of Simple Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings, pp. 233-244, 1992, Springer, 3-540-55210-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 2673 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|