Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
100 | Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell |
Touring a sequence of polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 473-482, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
safari route, watchman route, shortest path, NP-hardness, traveling salesman problem, polygons |
77 | Borut Zalik |
A fast algorithm for an envelope construction of a huge set of topologically consistent polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 19(1), pp. 35-44, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Two-level uniform subdivision, Algorithms, Computational geometry, Polygons, Envelope |
77 | Youdong Liang, Hujun Bao, Weihua Zhou |
A Morphing with Geometric Continuity between Two Arbitrary Planar Polygons. ![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. 448-449, 2002, IEEE Computer Society, 0-7695-1784-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Frenet frames, Rotation indexes and Winding numbers, Morphing, Polygons, Geometric Continuity |
75 | Hongjun Zhu, Jianwen Su, Oscar H. Ibarra |
Toward Spatial Joins for Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSDBM ![In: Proceedings of the 12th International Conference on Scientific and Statistical Database Management, Berlin, Germany, July 26-28, 2000, pp. 231-244, 2000, IEEE Computer Society, 0-7695-0686-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
I/O bounded polygon, trapezoid, polygon, spatial join |
75 | Ivan Stojmenovic |
Detecting intersection of two convex polygons in parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the Sixteenth ACM Annual Conference on Computer Science, Atlanta, Georgia, USA, February 23-25, 1988, pp. 736, 1988, ACM, 0-89791-260-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
69 | Deepti Joshi, Ashok Samal, Leen-Kiat Soh |
A dissimilarity function for clustering geospatial polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIS ![In: 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2009, November 4-6, 2009, Seattle, Washington, USA, Proceedings, pp. 384-387, 2009, ACM, 978-1-60558-649-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
clustering, polygons, spatial data mining, regionalization |
67 | Yong-Xi Gong, Yu Liu 0003, Lun Wu, Yu-Bo Xie |
Boolean Operations on Conic Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 24(3), pp. 568-577, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
conic polygon, Boolean operation, topological relationship |
67 | Robert A. Reckhow, Joseph C. Culberson |
Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Third Annual Symposium on Computational Geometry, Waterloo, Ontario, Canada, June 8-10, 1987, pp. 268-277, 1987, ACM, 0-89791-231-4. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
61 | Sasipalli V. S. Rao, Harada Koichi |
Reversibly Visible Polygons and Polygonal Approximation in Two Dimensional Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer Graphics International ![In: Computer Graphics International Conference, CGI 1997, Hasselt and Diepenbeek, Belgium, June 23-27, 1997, pp. 74-83, 1997, IEEE Computer Society, 0-8186-7825-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Polygonal line, windows in the edges, reversibly visible polygons, approximation |
59 | Wenjuan Gong, Changhe Tu |
Continuous Collision Detection between Two 2DCurved-Edge Polygons under Rational Motions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Advances in Geometric Modeling and Processing, 5th International Conference, GMP 2008, Hangzhou, China, April 23-25, 2008. Proceedings, pp. 79-91, 2008, Springer, 978-3-540-79245-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
conic splines, rational motion, continuous collision detection |
59 | Helmut Alt, Ferran Hurtado |
Packing Convex Polygons into Rectangular Boxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers, pp. 67-80, 2000, Springer, 3-540-42306-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
59 | Claudio Esperança, Hanan Samet |
Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSD ![In: Advances in Spatial Databases, 5th International Symposium, SSD'97, Berlin, Germany, July 15-18, 1997, Proceedings, pp. 197-220, 1997, Springer, 3-540-63238-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
59 | Christos Levcopoulos, Andrzej Lingas |
Bounds on the Length of Convex Partitions of Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Fourth Conference, Bangalore, India, December 13-15, 1984, Proceedings, pp. 279-295, 1984, Springer, 3-540-13883-8. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
55 | Cornelius W. A. M. van Overveld, Brian Wyvill |
An Algorithm for Polygon Subdivision Based on Vertex Normals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer Graphics International ![In: Computer Graphics International Conference, CGI 1997, Hasselt and Diepenbeek, Belgium, June 23-27, 1997, pp. 3-12, 1997, IEEE Computer Society, 0-8186-7825-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
55 | Karl Rehmer, Linda Rising |
A geometry package in Ada (abstract only). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 15th ACM Annual Conference on Computer Science, St. Louis, Missouri, USA, February 16-19, 1987, pp. 398, 1987, ACM, 0-89791-218-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
Ada |
53 | Evgeny Lipovetsky, Nira Dyn |
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 26(1-3), pp. 269-282, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
metric average, linear time complexity, morphing, convex polygons |
52 | Hongjun Zhu, Jianwen Su, Oscar H. Ibarra |
Extending Rectangle Join Algorithms for Rectilinear Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Web-Age Information Management ![In: Web-Age Information Management, First International Conference, WAIM 2000, Shanghai, China, June 21-23, 2000, Proceedings, pp. 247-258, 2000, Springer, 3-540-67627-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
52 | Leonidas J. Guibas, Jack Snoeyink, Li Zhang 0001 |
Compact Voronoi Diagrams for Moving Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 339-352, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
52 | Svante Carlsson, Bengt J. Nilsson |
Computing Vision Points in Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 24(1), pp. 50-75, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Art gallery problems, Algorithms, Computational geometry |
52 | Günther Greiner, Kai Hormann |
Efficient Clipping of Arbitrary Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 17(2), pp. 71-83, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
polygon comparison, clipping |
52 | Michal Etzion, Ari Rappoport |
On Compatible Star Decompositions of Simple Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 3(1), pp. 87-95, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Star decomposition, minimal star decomposition, compatible decompositions, compatible star decompositions |
52 | Amitava Datta, Christoph A. Hipke, Sven Schuierer |
Competitive Searching in Polygons - Beyond Generalised Streets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, pp. 32-41, 1995, Springer, 3-540-60573-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
52 | Lin-Lin Chen, Shuo-Yan Chou, Tony C. Woo |
Separating and Intersecting Spherical Polygons: Computing Machinability on Three-, Four-, and Five-axis Numerically Controlled Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 12(4), pp. 305-326, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
densest hemisphere, minimal/maximal intersection, numerically controlled machining, spherical algorithm, visibility algorithm, separation, bisection |
52 | David M. Mount |
Intersection Detection and Separators for Simple Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, Germany, June 10-12, 1992, pp. 303-311, 1992, ACM, 0-89791-517-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
50 | Menelaos I. Karavelas |
Guarding curvilinear art galleries with edge or mobile guards. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid and Physical Modeling ![In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, Stony Brook, New York, USA, June 2-4, 2008, pp. 339-345, 2008, ACM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
2-dominance, curvilinear polygons, diagonal guards, edge guards, mobile guards, piece-wise-convex polygons, triangulation graphs, art gallery |
49 | Arne Schuldt, Björn Gottfried, Otthein Herzog |
A compact shape representation for linear geographical objects: the scope histogram. ![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. 51-58, 2006, ACM, 1-59593-529-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bipartite arrangements, linear objects, qualitative shape description, scope histogram, geographic information systems, image retrieval, polygons |
48 | Rajeev Motwani 0001, Arvind Raghunathan, Huzur Saran |
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988, pp. 211-223, 1988, ACM, 0-89791-270-5. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
47 | Stephan J. Eidenbenz, Christoph Stamm |
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 200-212, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
45 | I-Lun Tseng, Adam Postula |
Partitioning parameterized 45-degree polygons with constraint programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 13(3), pp. 52:1-52:29, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Parameterized polygons, analog and mixed-signal design, parameterized layouts, trapezoidal corner stitching, polygon decomposition |
45 | Paolo Gronchi, Marco Longinetti |
Affinely Regular Polygons as Extremals of Area Functionals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(1-3), pp. 273-297, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Affinely regular polygons, Geometric tomography, Affine length |
45 | Michael S. Floater, Kai Hormann, Géza Kós |
A general construction of barycentric coordinates over convex polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 24(1-4), pp. 311-331, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
rational polynomials, convex polygons, barycentric coordinates |
45 | I-Lun Tseng, Adam Postula |
An efficient algorithm for partitioning parameterized polygons into rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 16th ACM Great Lakes Symposium on VLSI 2006, Philadelphia, PA, USA, April 30 - May 1, 2006, pp. 366-371, 2006, ACM, 1-59593-347-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
corner stitching, parameterized layouts, parameterized polygons, polygon decomposition |
45 | Jovisa D. Zunic, Paul L. Rosin |
A Rectilinearity Measurement for Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (2) ![In: Computer Vision - ECCV 2002, 7th European Conference on Computer Vision, Copenhagen, Denmark, May 28-31, 2002, Proceedings, Part II, pp. 746-758, 2002, Springer, 3-540-43744-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
rectilinearity, measurement, Shape, polygons |
44 | Josef Kallrath |
Cutting circles and polygons from area-minimizing rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 43(2-3), pp. 299-328, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Non-overlap constraints, Global Optimization, Mixed integer programming, Assignment, Packing problem, Cutting stock problem, Shape constraints, Design problem |
44 | Ana Paula Tomás, António Leslie Bajuelos |
Generating Random Orthogonal Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAEPIA ![In: Current Topics in Artificial Intelligence, 10th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2003, and 5th Conference on Technology Transfer, TTIA 2003, San Sebastian, Spain, November 12-14, 2003. Revised Selected Papers, pp. 364-373, 2003, Springer, 3-540-22218-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Atsushi Imiya, S. Kudo |
Docking of Polygons Using Boundary Descriptor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAIP ![In: Computer Analysis of Images and Patterns, 10th International Conference, CAIP 2003, Groningen, The Netherlands, August 25-27, 2003, Proceedings, pp. 25-32, 2003, Springer, 3-540-40730-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Atef Bel Hadj Ali |
Moment representation of polygons for the assessment of their shape quality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Geogr. Syst. ![In: J. Geogr. Syst. 4(2), pp. 209-232, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Arijit Laha, Amitava Sen, Bhabani P. Sinha |
Parallel Algorithms for Identification of Basis Polygons in an Image. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2002, 9th International Conference, Bangalore, India, December 18-21, 2002, Proceedings, pp. 302-312, 2002, Springer, 3-540-00303-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Zhenyu Li, Victor Milenkovic |
A Compaction Algorithm for Non-Convex Polygons and Its Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993, pp. 153-162, 1993, ACM, 0-89791-582-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
44 | Mark de Berg |
Translating Polygons with Applications to Hidden Surface Removal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings, pp. 60-70, 1990, Springer, 3-540-52846-6. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
separation problems, relative convex hulls, Computational geometry, hidden surface removal |
44 | Frank K. H. A. Dehne, Jörg-Rüdiger Sack |
Seperability of Sets of Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graphtheoretic Concepts in Computer Science, International Workshop, WG '86, Bernried, Germany, June 17-19, 1986, Proceedings, pp. 237-251, 1986, Springer, 3-540-17218-1. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
41 | Martin Paluszewski, Pawel Winter, Martin Zachariasen |
A new paradigm for general architecture routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, Boston, MA, USA, April 26-28, 2004, pp. 202-207, 2004, ACM, 1-58113-853-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Steiner trees in uniform orientation metrics, flexibility polygons, non-manhattan routing, VLSI routing |
41 | Danny Z. Chen, Xiaobo Hu 0001, Shuang Luan, Chao Wang 0002, Xiaodong Wu 0001 |
Geometric algorithms for static leaf sequencing problems in radiation therapy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 88-97, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
leaf sequencing, monotone polygons, polygon partition, network flows, radiation therapy, IMRT |
39 | Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott Duke Kominers |
Hinged dissections exist. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 110-119, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hinging, motion |
39 | Nick Barnes, Gareth Loy, David Shaw, Antonio Robles-Kelly |
Regular Polygon Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 10th IEEE International Conference on Computer Vision (ICCV 2005), 17-20 October 2005, Beijing, China, pp. 778-785, 2005, IEEE Computer Society, 0-7695-2334-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Kagenori Kajihara, Hiroki Takahashi, Masayuki Nakajima 0001 |
A Method of Rendering Scenes Including Volumetric Objects Using Ray-Volume Buffers - Expanding to Render Scenes Including Overlapped Volumetric Object. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer Graphics International ![In: 2003 Computer Graphics International (CGI 2003), 9-11 July 2003, Tokyo, Japan, pp. 230-235, 2003, IEEE Computer Society, 0-7695-1946-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
39 | Ediz Saykol, Gürcan Gülesir, Ugur Güdükbay, Özgür Ulusoy |
KiMPA: A Kinematics-Based Method for Polygon Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADVIS ![In: Advances in Information Systems, Second International Conference, ADVIS 2002, Izmir, Turkey, October 23-25, 2002, Proceedings, pp. 186-194, 2002, Springer, 3-540-00009-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
39 | Stephan J. Eidenbenz, Peter Widmayer |
An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 333-344, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
39 | Pankaj K. Agarwal, Eyal Flato, Dan Halperin |
Polygon Decomposition for Efficient Construction of Minkowski Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 20-31, 2000, Springer, 3-540-41004-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
39 | Xiaofang Zhou 0001, David Truffet, Jiawei Han 0001 |
Efficient Polygon Amalgamation Methods for Spatial OLAP and Spatial Data Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSD ![In: Advances in Spatial Databases, 6th International Symposium, SSD'99, Hong Kong, China, July 20-23, 1999, Proceedings, pp. 167-187, 1999, Springer, 3-540-66247-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
polygon amalgamation, spatial databases, spatial indexing, on-line analytical processing (OLAP) |
39 | Kurt Mehlhorn, Chee-Keng Yap |
Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 410-423, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Larry Bergman, Henry Fuchs, Eric D. Grant, Susan Spach |
Image rendering by adaptive refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 13th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1986, Dallas, Texas, USA, August 18-22, 1986, pp. 29-37, 1986, ACM, 0-89791-196-2. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
38 | Vincent Pilaud, Francisco Santos |
Multitriangulations as Complexes of Star Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 284-317, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Generalized triangulation, Crossing-free graph, Star polygons, Flips, Associahedron |
38 | Kevin Buchin, Maike Buchin, Carola Wenk |
Computing the Fréchet distance between simple polygons in polynomial time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 80-87, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Fréchet distance, shape matching, simple polygons |
38 | Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe |
Exploring Simple Grid Polygons. ![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. 524-533, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
grid polygons, lower bounds, online algorithms, competitive analysis, exploration, Robot navigation, covering |
38 | Mario Alberto López, Dinesh P. Mehta |
Efficient decomposition of polygons into L-shapes with application to VLSI layouts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 1(3), pp. 371-395, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
L-shapes, corner stitching, partition, rectangle, rectilinear polygons |
36 | Therese C. Biedl, Stephane Durocher, Jack Snoeyink |
Reconstructing Polygons from Scanner Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 862-871, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc |
Optimality and Competitiveness of Exploring Polygons by Mobile Robots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 263-274, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Vadim Trofimov, Kira Vyatkina |
Linear Axis for General Polygons: Properties and Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings, Part I, pp. 122-135, 2007, Springer, 978-3-540-74468-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Siddharth Manay, David W. Paglieroni |
Matching Flexible Polygons to Fields of Corners Extracted from Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAR ![In: Image Analysis and Recognition, 4th International Conference, ICIAR 2007, Montreal, Canada, August 22-24, 2007, Proceedings, pp. 447-459, 2007, Springer, 978-3-540-74258-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Corner Extraction, Polygon Extraction, Overhead Imagery |
36 | Kai Hormann, Michael S. Floater |
Mean value coordinates for arbitrary planar polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 25(4), pp. 1424-1441, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
interpolation, Barycentric coordinates |
36 | Véronique Delouille, Ramesh Neelamani, Richard G. Baraniuk |
Robust distributed estimation in sensor networks using the embedded polygons algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPSN ![In: Proceedings of the Third International Symposium on Information Processing in Sensor Networks, IPSN 2004, Berkeley, California, USA, April 26-27, 2004, pp. 405-413, 2004, ACM, 1-58113-846-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
matrix splitting, sensor networks, hidden Markov models, graphical models, Wiener filter, distributed estimation |
36 | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs |
Angles and Lengths in Reconfigurations of Polygons and Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 748-759, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Jan Kratochvíl, Martin Pergel |
Two Results on Intersection Graphs of Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers, pp. 59-70, 2003, Springer, 3-540-20831-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Niklas Elmqvist, Philippas Tsigas |
Causality Visualization Using Animated Growing Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOVIS ![In: 9th IEEE Symposium on Information Visualization (InfoVis 2003), 20-21 October 2003, Seattle, WA, USA, pp. 189-196, 2003, IEEE Computer Society, 0-7695-2055-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
information visualization, interactive animation, causal relations |
36 | Gian Paolo Lorenzetto, Amitava Datta |
A Linear Time Heuristics for Trapezoidation of GIS Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2002, International Conference, Amsterdam, The Netherlands, April 21-24, 2002. Proceedings, Part III, pp. 75-84, 2002, Springer, 3-540-43594-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Kokichi Sugihara |
Invertible Minkowski Sum of Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 10th International Conference, DGCI 2002, Bordeaux, France, April 3-5, 2002, Proceedings, pp. 350-359, 2002, Springer, 3-540-43380-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Jin Akiyama, Gisaku Nakamura |
Dudeney Dissections of Polygons and Polyhedrons - A Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers, pp. 1-30, 2000, Springer, 3-540-42306-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
36 | David G. Kirkpatrick, Bettina Speckmann |
Separation Sensitive Kinetic Separation Structures for Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers, pp. 222-236, 2000, Springer, 3-540-42306-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
36 | M. Carmen Hernando, Michael E. Houle, Ferran Hurtado |
On Local Transformation of Polygons with Visibility Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings, pp. 54-63, 2000, Springer, 3-540-67787-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
36 | Amitava Datta, Kamala Krithivasan, Thomas Ottmann |
An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings, pp. 110-121, 1997, Springer, 3-540-62592-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
36 | G. MacDonald, Thomas C. Shermer |
Isomorphism of Spiral Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 16(3), pp. 277-304, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
36 | Eric Andres, Claudio H. Sibata, Raj Acharya |
Supercover 3D polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 6th International Workshop, DCGI'96, Lyon, France, November 13-15, 1996, Proceedings, pp. 237-242, 1996, Springer, 3-540-62005-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
36 | Gert Vegter |
Kink-Free Deformations of Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989, pp. 61-68, 1989, ACM, 0-89791-318-3. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
36 | Cao An Wang, Edward P. F. Chan |
Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple 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. 34-42, 1986, ACM, 0-89791-194-6. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
36 | Guy Bruno Jr., Walter G. Rudd |
A similarity index for convex polygons (abstract only). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 13th ACM Annual Conference on Computer Science, New Orleans, Louisiana, USA, 1985, pp. 420, 1985, ACM, 0-89791-150-4. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
36 | Christos Levcopoulos, Andrzej Lingas |
Covering Polygons with Minimum Number of Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings, pp. 63-72, 1984, Springer, 3-540-12920-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
33 | Michael A. Bekos, Michael Kaufmann 0001, Katerina Potika, Antonios Symvonis |
Polygon labelling of minimum leader length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APVIS ![In: Asia-Pacific Symposium on Information Visualisation, APVIS 2006, Tokyo, Japan, February 1-3, 2006, pp. 15-21, 2006, Australian Computer Society, 1-920682-41-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
boundary labelling, floating sites, polygons, map labelling |
33 | Ioannis P. Ivrissimtzis, Rhaleb Zayer, Hans-Peter Seidel |
Polygonal Decomposition of the 1-Ring Neighborhood of the Catmull-Clark Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMI ![In: 2004 International Conference on Shape Modeling and Applications (SMI 2004), 7-9 June 2004, Genova, Italy, pp. 101-109, 2004, IEEE Computer Society, 0-7695-2075-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
evolving polygons, Catmull-Clark, circulant-block matrices, subdivision |
33 | Zhunping Zhang, Lifeng Wang 0001, Baining Guo, Heung-Yeung Shum |
Feature-based light field morphing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 21(3), pp. 457-464, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
3D morphing, feature polygons, global visibility map, ray correspondence, ray-space warping, light field |
33 | Roop K. Goyal, Max J. Egenhofer |
Consistent Queries over Cardinal Directions across Different Levels of Detail. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA Workshops ![In: 11th International Workshop on Database and Expert Systems Applications (DEXA'00), 6-8 September 2000, Greenwich, London, UK, pp. 876-880, 2000, IEEE Computer Society, 0-7695-0680-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
cardinal directions, geometric data types, deep direction-relation matrix, spatial query languages, geographic information systems, geographic information system, spatial database, polygons, query formulation |
31 | Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt 0001 |
Minimum Covering with Travel Cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 393-402, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Danny Z. Chen, Ewa Misiolek |
Free-Form Surface Partition in 3-D. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 520-531, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Ron Wein |
Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 829-840, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Jun Lee, Sungjun Park, Jee-In Kim |
Adaptive Real-Time Rendering for Large-Scale Molecular Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVC (2) ![In: Advances in Visual Computing, Second International Symposium, ISVC 2006 Lake Tahoe, NV, USA, November 6-8, 2006. Proceedings, Part II, pp. 383-392, 2006, Springer. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Jie Wu 0001, Zhen Jiang |
On constructing the minimum orthogonal convex polygon for the fault-tolerant routing in 2-D faulty meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 54(3), pp. 449-458, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Gereon Frahling, Jens Krokowski |
Online Occlusion Culling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 758-769, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Vitaly Surazhsky, Craig Gotsman |
High quality compatible triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 20(2), pp. 147-156, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Compatible triangulations, Low discrepancy point sets, Sweep meshes, Morphing, Remeshing |
31 | Mirela Damian, Sriram V. Pemmaraju |
Computing Optimal Diameter-Bounded Polygon Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(1), pp. 1-14, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Diameter-bounded, Approximation algorithm, Polygon decomposition |
31 | Jie Wu 0001, Zhen Jiang |
On Constructing the Minimum Orthogonal Convex Polygon in 2-D Faulty Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Rodrigo Salvador Monteiro, Leonardo Guerreiro Azevedo, Geraldo Zimbrao, Jano Moreira de Souza |
Polygon and Polyline Join Using Raster Filters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advances Applications, 9th International Conference, DASFAA 2004, Jeju Island, Korea, March 17-19, 2004, Proceedings, pp. 255-261, 2004, Springer, 3-540-21047-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
raster approximations, geometric filters, spatial databases, Spatial join |
31 | Q. Li, Sung-Mo Kang |
Trapezoid-to-simple polygon recomposition for resistance extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (5) ![In: Proceedings of the 2001 International Symposium on Circuits and Systems, ISCAS 2001, Sydney, Australia, May 6-9, 2001, pp. 495-498, 2001, IEEE, 0-7803-6685-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Erlend Tøssebro, Ralf Hartmut Güting |
Creating Representations for Continuously Moving Regions from Observations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSTD ![In: Advances in Spatial and Temporal Databases, 7th International Symposium, SSTD 2001, Redondo Beach, CA, USA, July 12-15, 2001, Proceedings, pp. 321-344, 2001, Springer, 3-540-42301-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Michaël Chelle, Bruno Andrieu, Kadi Bouatouch |
Nested radiosity for plant canopies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 14(3), pp. 109-125, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Nested model, Vegetation, Validation, Global illumination, Radiosity |
31 | Christos Levcopoulos, Anna Östlin |
Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 271-283, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
31 | Wei-pang Chin, Simeon C. Ntafos |
Optimum Watchman Routes. ![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. 24-33, 1986, ACM, 0-89791-194-6. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
30 | Dan Ismailescu |
Circumscribed Polygons of Small Area. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(4), pp. 583-589, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Convex regions, Circumscribed polygons |
30 | Ioannis P. Ivrissimtzis, Hans-Peter Seidel |
Evolutions of Polygons in the Study of Subdivision Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 72(1-2), pp. 93-103, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
evolving polygons, Subdivision, circulant matrices |
30 | Jovisa D. Zunic, Paul L. Rosin |
Rectilinearity Measurements for Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 25(9), pp. 1193-1200, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
rectilinearity, measurement, Shape, polygons |
30 | Peter Schröder, Pat Hanrahan |
On the form factor between two polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1993, Anaheim, CA, USA, August 2-6, 1993, pp. 163-164, 1993, ACM, 0-89791-601-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
polygons, closed form solution, form factor |