|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 592 occurrences of 360 keywords
|
|
|
Results
Found 1425 publication records. Showing 1425 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
105 | Kenji Kashiwabara, Masataka Nakamura, Takashi Takabatake |
Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 289-303, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
103 | Peter Hachenberger |
Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(2), pp. 329-345, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Decomposition of polyhedra into convex pieces, Nef polyhedra, Tight passage, Exact arithmetic, Minkowski sum |
102 | Roberto Bagnara, Patricia M. Hill, Enea Zaffanella |
Not necessarily closed convex polyhedra and the double description method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 17(2), pp. 222-257, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Double description, Strict linear inequalities, Abstract interpretation, Data-flow analysis, Convex polyhedra |
99 | Roberto Bagnara, Elisa Ricci 0002, Enea Zaffanella, Patricia M. Hill |
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 9th International Symposium, SAS 2002, Madrid, Spain, September 17-20, 2002, Proceedings, pp. 213-229, 2002, Springer, 3-540-44235-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
85 | Egon Schulte |
Chiral Polyhedra in Ordinary Space, I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(1), pp. 55-99, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
82 | Yi-King Choi, Xueqing Li, Fengguang Rong, Wenping Wang, Stephen Cameron |
Determining Directional Contact Range of Two Convex Polyhedra. ![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. 127-142, 2008, Springer, 978-3-540-79245-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
directional contact range, separating distance, penetrating distance, duality transformation, signed distance, convex polyhedra |
79 | Nicolas Halbwachs, David Merchat, Laure Gonnord |
Some ways to reduce the space dimension in polyhedra computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 29(1), pp. 79-95, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Linear relation analysis, Double description, Cartesian product of polyhedra, Program analysis, Convex polyhedra |
79 | Zbigniew Chamski |
Beyond convexity: scanning 'non-convex polyhedra'. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 73-82, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
nonconvex polyhedra, point enumeration, algebraically-specified domain, algorithmic problem, scientific program transformation, scanning algorithms, runtime overhead, regularly nonconvex domains, arbitrary unions, nested loop sequences, parallel algorithms, parallel programming, computational geometry, convexity, program interpreters, program control structures, convex polyhedra |
75 | David Eppstein, Elena Mumford |
Steinitz theorems for orthogonal polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 429-438, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Steinitz theorem, orthogonal polyhedron, planar graph |
75 | Sriram Sankaranarayanan 0001, Thao Dang 0001, Franjo Ivancic |
Symbolic Model Checking of Hybrid Systems Using Template Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings, pp. 188-202, 2008, Springer, 978-3-540-78799-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
69 | Peter Hachenberger |
Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 669-680, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
66 | Mark de Berg, Mark H. Overmars |
Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 252-261, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
c-oriented polyhedra, axis-parallel polyhedra, axis-parallel polyhedra, cyclic overlap, complexity, hidden surface removal, visibility map |
65 | Peter Hachenberger, Lutz Kettner |
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid and Physical Modeling ![In: Proceedings of the Tenth ACM Symposium on Solid and Physical Modeling 2005, Cambridge, Massachusetts, USA, June 13-15, 2005, pp. 163-174, 2005, ACM, 1-59593-015-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
boundary evaluation, exactness, nef polyhedra, unbounded polyhedra, algorithms, data structures, benchmark, robustness, experiments, completeness, CSG, non-manifold, B-rep |
65 | Edward Verbree, Hang Si |
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIScience ![In: Geographic Information Science, 5th International Conference, GIScience 2008, Park City, UT, USA, September 23-26, 2008. Proceedings, pp. 354-369, 2008, Springer, 978-3-540-87472-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
65 | Roberto Bagnara, Patricia M. Hill, Elisa Ricci 0002, Enea Zaffanella |
Precise Widening Operators for Convex Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003, Proceedings, pp. 337-354, 2003, Springer, 3-540-40325-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
65 | Rebecca Alexander, Heather Dyson, Joseph O'Rourke |
The Foldings of a Square to Convex Polyhedra. ![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. 38-50, 2002, Springer, 3-540-20776-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
65 | Olivier Bournez, Oded Maler |
On the Representation of Timed Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 793-807, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
65 | Jean-Daniel Boissonnat, Mariette Yvinec |
Probing a Scene of Non Convex Polyhedra. ![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. 237-246, 1989, ACM, 0-89791-318-3. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
54 | Haim Kaplan, Natan Rubin, Micha Sharir |
Line transversals of convex polyhedra in R3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 170-179, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
54 | Egon Schulte |
Chiral Polyhedra in Ordinary Space, II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 34(2), pp. 181-229, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
54 | Efi Fogel, Dan Halperin |
Exact Minkowski sums of convex polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 382-383, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
54 | Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides |
The number of lines tangent to arbitrary convex polyhedra in 3D. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 46-55, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
3D visibility, visibility complex, visual events, computational geometry |
54 | Nobuaki Mutoh |
The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere. ![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. 204-214, 2002, Springer, 3-540-20776-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
54 | Basudeb Datta, Nandini Nilakantan |
Equivelar Polyhedra with Few Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 26(3), pp. 429-461, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
54 | Jos B. T. M. Roerdink, Henk Bekker |
Similarity Measure Computation of Convex Polyhedra Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Digital and Image Geometry ![In: Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000], pp. 389-399, 2000, Springer, 3-540-43079-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
54 | Philippe Martin, Dominique Martin |
PolyFormes: software for the declarative modelling of polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 15(2), pp. 55-76, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Uniform polyhedron, Geometric modelling, Declarative modelling |
54 | Olivier Bournez, Oded Maler, Amir Pnueli |
Orthogonal Polyhedra: Representation and Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, Second International Workshop, HSCC'99, Berg en Dal, The Netherlands, March 29-31, 1999, Proceedings, pp. 46-60, 1999, Springer, 3-540-65734-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
54 | Branko Grünbaum |
Realizations of Symmetric Maps by Symmetric Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 20(1), pp. 19-33, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
54 | William C. Thibault, Bruce F. Naylor |
Set operations on polyhedra using binary space partitioning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1987, Anaheim, California, USA, July 27-31, 1987, pp. 153-162, 1987, ACM, 0-89791-227-6. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
51 | Haim Kaplan, Natan Rubin, Micha Sharir |
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(2), pp. 283-310, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Computational geometry, Ray-shooting, Convex polyhedra, Lines in space |
51 | Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß |
Diameter of polyhedra: limits of abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 386-392, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
disjoint coverings, hirsch conjecture, polyhedra, convex geometry |
51 | Mirela Damian, Robin Y. Flatland, Joseph O'Rourke |
Grid Vertex-Unfolding Orthogonal Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(1-3), pp. 213-238, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Vertex-unfolding, Grid unfolding, Orthogonal polyhedra, Genus-zero |
51 | Yukiko Kenmochi, Atsushi Imiya, Norberto F. Ezquerra |
Polyhedra generation from lattice points. ![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. 127-138, 1996, Springer, 3-540-62005-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
lattice space, topology, medical images, Polyhedra, boundary detection |
50 | Francis Y. L. Chin, Stanley P. Y. Fung |
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 172-184, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
50 | 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 |
|
50 | Bruce F. Naylor, John Amanatides, William C. Thibault |
Merging BSP trees yields polyhedral set operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1990, Dallas, TX, USA, August 6-10, 1990, pp. 115-124, 1990, ACM, 0-201-50933-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
47 | Jim Morey, Kamran Sedig, Robert E. Mercer |
Interactive Metamorphic Visuals: Exploring Polyhedral Relationships. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: International Conference on Information Visualisation, IV 2001, London, England, UK, July 25-27, 2001, pp. 483-488, 2001, IEEE Computer Society, 0-7695-1195-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
mindtool, kaleidoscope, Platonic solids, Archimedean solids, interaction, learning, symmetry, 3D visuals, polyhedra, Metamorphosis |
47 | Brian Mirtich |
V-Clip: Fast and Robust Polyhedral Collision Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 17(3), pp. 177-208, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
collision detection, polyhedra |
44 | Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman |
Straight Skeletons of Three-Dimensional Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 148-160, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Liqian Chen, Antoine Miné, Patrick Cousot |
A Sound Floating-Point Polyhedra Abstract Domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, 6th Asian Symposium, APLAS 2008, Bangalore, India, December 9-11, 2008. Proceedings, pp. 3-18, 2008, Springer, 978-3-540-89329-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Peter McMullen |
Four-Dimensional Regular Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(2), pp. 355-387, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Axel Simon, Andy King |
Widening Polyhedra with Landmarks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, 4th Asian Symposium, APLAS 2006, Sydney, Australia, November 8-10, 2006, Proceedings, pp. 166-182, 2006, Springer, 3-540-48937-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
44 | Boris Aronov, Mark de Berg, Chris Gray |
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. ![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. 88-94, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
computational geometry, ray shooting, fat objects, intersection searching |
44 | Vladlen Koltun, Micha Sharir |
Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 31(1), pp. 83-124, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Boting Yang, Cao An Wang |
Minimal Tetrahedralizations of a Class of Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(3), pp. 241-265, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
computational geometry, polyhedron, tetrahedralization |
44 | Ralph E. Gomory, Ellis L. Johnson, Lisa Evans |
Corner Polyhedra and their connection with cutting planes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 96(2), pp. 321-339, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Jeff Erickson 0001 |
Local polyhedra and geometric graphs. ![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. 171-180, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
realistic input models, collision detection, bounding volume hierarchies, binary space partition |
44 | Nicolas Halbwachs, David Merchat, Catherine Parent-Vigouroux |
Cartesian Factoring of Polyhedra in Linear Relation Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003, Proceedings, pp. 355-365, 2003, Springer, 3-540-40325-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Federico Thomas, Carme Torras |
A projectively invariant intersection test for polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 18(7), pp. 405-414, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Intersection detection, Degenerate configurations, 4×4 determinant method, Projective invariance |
44 | Vladlen Koltun, Micha Sharir |
Polyhedral Voronoi diagrams of polyhedra in three dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002, pp. 227-236, 2002, ACM, 1-58113-504-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
polyhedral distance function, polyhedral sites, Voronoi diagrams, three dimensions |
44 | Katsuaki Kawachi, Hiromasa Suzuki |
Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Geometric Modeling and Processing 2000, Hong Kong, China, April 10-12, 2000, pp. 123-128, 2000, IEEE Computer Society, 0-7695-0562-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Voronoi Region, Computational Geometry, Distance Computation |
44 | Cao An Wang, Bo-Ting Yang |
Tetrahedralization of Two Nested Convex Polyhedra. ![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. 291-298, 2000, Springer, 3-540-67787-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
44 | Eduardo Uchoa, Marcus Poggi de Aragão |
Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 439-452, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
44 | Richard Lobb |
Quasiconvolutional smoothing of polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 12(8), pp. 373-389, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Ray tracing, Implicit surface, Convolution, Rounding, Constructive solid geometry |
44 | Charlie Rothwell, Julien P. Stern |
Understanding the Shape Properties of Trihedral Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (1) ![In: Computer Vision - ECCV'96, 4th European Conference on Computer Vision, Cambridge, UK, April 15-18, 1996, Proceedings, Volume I, pp. 175-185, 1996, Springer, 3-540-61122-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
44 | Ammar Joukhadar, Ahmad Wabbi, Christian Laugier |
Fast Contact Localization Between Deformable Polyhedra in Motion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CA ![In: Computer Animation 1996, CA 1996, Geneva, Switzerland, June 3-4, 1996, pp. 126-135, 1996, IEEE Computer Society, 0-8186-7588-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
contact detection, virtual reality, interaction, Animation, physical modeling, deformable objects |
44 | Peter L. Williams |
Visibility-Ordering Meshed Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 11(2), pp. 103-126, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
depth ordering, volume rendering, scientific visualization, finite element methods, triangulation, Delaunay triangulation, volume visualization, mesh generation, scattered data, point location, visibility ordering |
44 | David P. Dobkin, David G. Kirkpatrick |
Determining the Separation of Preprocessed Polyhedra - A Unified Approach. ![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. 400-413, 1990, Springer, 3-540-52826-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
41 | Eryk Kopczynski, Igor Pak, Piotr Przytycki |
Acute triangulations of polyhedra and the Euclidean space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 307-313, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
triangulations, polyhedra |
41 | ByungMoon Kim, Jarek Rossignac |
Collision prediction for polyhedra under screw motions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid Modeling and Applications ![In: Proceedings of the Eighth ACM Symposium on Solid Modeling and Applications 2003, Seattle, Washington, USA, June 16 - 20, 2003, pp. 4-10, 2003, ACM, 1-58113-752-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
screw motion, collision detection, polyhedra |
41 | Lefteris M. Kirousis |
Effectively Labeling Planar Projections of Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(2), pp. 123-130, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
3D polyhedra, planar projections labelling, Clowes-Huffman scheme, linear-in-time algorithm, time polynomial, computational complexity, computational geometry, computerised picture processing, computerised picture processing, computerised pattern recognition, computerised pattern recognition, polynomials, labelability |
40 | Gautam Gupta, Sanjay V. Rajopadhye |
The Z-polyhedral model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPoPP ![In: Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2007, San Jose, California, USA, March 14-17, 2007, pp. 237-248, 2007, ACM, 978-1-59593-602-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
equational programming, program transformation, models of computations, loop optimization |
40 | Egon Balas |
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 140(1), pp. 125-161, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
sequential convexification, 0-1 programming, disjunctive programming, lift-and-project |
40 | Egon Balas |
Projection and Lifting in Combinatorial Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Combinatorial Optimization ![In: Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000], pp. 26-56, 2001, Springer, 3-540-42877-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
40 | Arthur D. Gregory, Andrei State, Ming C. Lin, Dinesh Manocha, Mark A. Livingston |
Interactive surface decomposition for polyhedral morphing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 15(9), pp. 453-470, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Surface decomposition, 3D polyhedral morphing, Animation, Geometric features, Metamorphosis |
40 | Branko Grünbaum |
Isogonal Prismatoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 18(1), pp. 13-52, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
37 | Goran Frehse |
PHAVer: algorithmic verification of hybrid systems past HyTech. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 10(3), pp. 263-279, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Verification, Tools, Hybrid systems, Polyhedra |
37 | Hongbo Li 0012 |
nD Polyhedral Scene Reconstruction from Single 2D Line Drawing by Local Propagation. ![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. 169-197, 2004, Springer, 3-540-31332-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Structural Reconstruction, Grassmann-Cayley Algebra, Local Propagation, Polyhedra, Geometric Reconstruction |
37 | Marc Alexa |
Merging Polyhedral Shapes with Scattered Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Shape Modeling International ![In: 1999 Shape Modeling International (SMI '99), 1-4 March 1999, Aizu, Japan, pp. 202-210, 1999, IEEE Computer Society, 0-7695-0065-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Scattered Features, Morphing, Polyhedra |
37 | Andrew Zisserman, Joseph L. Mundy, David A. Forsyth, Jane Liu, Nic Pillow, Charlie Rothwell, Sven Utcke |
Class-Based Grouping in Perspective Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: Procedings of the Fifth International Conference on Computer Vision (ICCV 95), Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, June 20-23, 1995, pp. 183-188, 1995, IEEE Computer Society, 0-8186-7042-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
perspective images, class-based grouping, individual object, 3D geometric class, image outline, image constraints, feature grouping, 3D invariant descriptions, symmetry axes, canonical coordinate frames, projective signatures, real cluttered scenes, grouping algorithms, rotationally symmetric surfaces, canal surfaces, feature extraction, computational geometry, object recognition, image recognition, image features, polyhedra, perspective projection, feature identification, complex scene, object recognition system |
37 | Zbigniew Chamski |
Enumeration of dense non-convex iteration sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 3rd Euromicro Workshop on Parallel and Distributed Processing (PDP '95), January 25-27, 1995, San Remo, Italy, pp. 156-163, 1995, IEEE Computer Society, 0-8186-7031-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
dense non-convex iteration sets, algorithmic problems, iteration domains, loop structures, arbitrary unions, dense convex polyhedra, incremental construction, nested loop sequence, loop execution, parallel algorithms, parallel programming, parallel programming, set theory, polyhedron, scientific programs |
34 | Antoine Deza, Gabriel Indik |
A counterexample to the dominating set conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 1(2), pp. 163-169, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Dominating set conjecture, Metric polyhedra, Cut polyhedra |
34 | Jean François Maurras |
A family of easy polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 7(2), pp. 139-144, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
MSC classification (2000) 52B12, 68Q17, 68Q25 |
34 | Liqian Chen, Antoine Miné, Ji Wang 0001, Patrick Cousot |
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 16th International Symposium, SAS 2009, Los Angeles, CA, USA, August 9-11, 2009. Proceedings, pp. 309-325, 2009, Springer, 978-3-642-03236-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Ezra Miller, Igor Pak |
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(1-3), pp. 339-388, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Mark de Berg, Chris Gray |
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 173-184, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Sriram Sankaranarayanan 0001, Thao Dang 0001, Franjo Ivancic |
A Policy Iteration Technique for Time Elapse over Template Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 11th International Workshop, HSCC 2008, St. Louis, MO, USA, April 22-24, 2008. Proceedings, pp. 654-657, 2008, Springer, 978-3-540-78928-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Claudio Mirolo, Stefano Carpin, Enrico Pagello |
Incremental Convex Minimization for Computing Collision Translations of Convex Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Robotics ![In: IEEE Trans. Robotics 23(3), pp. 403-415, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Esther Ezra, Micha Sharir |
A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 37(1), pp. 21-41, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Károly Bezdek, Zsolt Lángi, Márton Naszódi, Peter Papez |
Ball-Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(2), pp. 201-230, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Károly Bezdek |
From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVD ![In: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2007, Pontypridd, Wales, UK, July 9-12, 2007, pp. 3-6, 2007, IEEE Computer Society, 0-7695-2869-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Haim Kaplan, Natan Rubin, Micha Sharir |
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 287-298, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Dennis Michaels, Robert Weismantel |
Polyhedra related to integer-convex polynomial systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 105(2-3), pp. 215-232, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 52B12, 90C10 |
34 | Xinyu Zhang 0002, Minkyoung Lee, Young J. Kim |
Interactive continuous collision detection for non-convex polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 22(9-11), pp. 749-760, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Conservative advancement, Dynamics simulation, Continuous collision detection, Convex decomposition |
34 | Mirela Damian, Robin Y. Flatland, Joseph O'Rourke |
Grid Vertex-Unfolding Orthogonal Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 264-276, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Esther Ezra |
Almost tight bound for a single cell in an arrangement of convex polyhedra in R3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 22-31, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Monika Kowalczyk, Wojciech S. Mokrzycki |
Concept of 3D View Model of Non-Convex Polyhedra Generation Using View Sphere Partitioning into Single-View Areas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CORES ![In: Computer Recognition Systems, Proceedings of the 4th International Conference on Computer Recognition Systems, CORES'05, May 22-25, 2005, Rydzyna Castle, Poland, pp. 411-418, 2005, Springer, 978-3-540-25054-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz |
Efficient View Point Selection for Silhouettes of Convex 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. 735-747, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Peter W. Messer |
Closed-Form Expressions for Uniform Polyhedra and Their Duals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 27(3), pp. 353-375, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang |
Approximation for minimum triangulation of convex polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 128-137, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
34 | Eva Dyllong, Wolfram Luther, Werner Otten |
An Accurate Distance-Calculation Algorithm for Convex Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Comput. ![In: Reliab. Comput. 5(3), pp. 241-253, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Pierre Boulet, Paul Feautrier |
Scanning Polyhedra without Do-loops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE PACT ![In: Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998, pp. 4-11, 1998, IEEE Computer Society, 0-8186-8591-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
PIP, polyheron scanning, linearly bounded lattices, code generation, integer programming, Automatic parallelization |
34 | Jim Ruppert, Raimund Seidel |
On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra. ![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. 380-392, 1989, ACM, 0-89791-318-3. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
34 | Chandrajit L. Bajaj, Tamal K. Dey |
Robust Decompositions of Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings, pp. 267-279, 1989, Springer, 3-540-52048-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
31 | Hichem Barki, Florence Denis, Florent Dupont |
A New Algorithm for the Computation of the Minkowski Difference of Convex Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Shape Modeling International ![In: SMI 2010, Shape Modeling International Conference, Aix en Provence, France, June 21-23 2010, pp. 206-210, 2010, IEEE Computer Society, 978-0-7695-4072-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
contributing vertices, Minkowski difference, Nef polyhedra, Minkowski sum |
31 | Muhammad Ashraful Alam, Masud Hasan |
Computing Nice Projections of Convex Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008., pp. 111-119, 2008, Springer, 978-3-540-77890-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
nice orthogonal projections, Voronoi diagram, views, Convex polyhedra |
31 | Efi Fogel, Dan Halperin, Christophe Weibel |
On the exact maximum complexity of Minkowski sums of convex polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 319-326, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
complexity, convex, polyhedra, Minkowski sum |
31 | Herbert Edelsbrunner |
Algebraic Decompositions of Non-Convex Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 248-257, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
algebraic decomposition, nonconvex polyhedra, arbitrary polyhedron, algebraic sum, half-spaces, point classification, Gram-Sommerville angle relation, parallel algorithms, parallel algorithm, computational geometry, boolean formula |
31 | Evan C. Sherbrooke, Nicholas M. Patrikalakis, Erik Brisson |
Computation of the Medial Axis Transform of 3-D polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid Modeling and Applications ![In: Third ACM SIGGRAPH Symposium on Solid Modeling and Applications, Salt Lake City, Utah, USA, May 17-19, 1995, pp. 187-200, 1995, ACM, 0-89791-672-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
CAD, geometric modeling, Voronoi diagram, skeleton, symmetry, solid modeling, polyhedra, CAM, CAGD |
31 | Boris Aronov, Micha Sharir |
The Union of Convex Polyhedra in Three Dimensions ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 518-527, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
union of convex polyhedra, almost tight, edges, faces, vertices, three dimensions, randomized incremental algorithm |
Displaying result #1 - #100 of 1425 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|