Search results for "Polyhedra"

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.	IPCO	1999	DBLP DOI BibTeX RDF
103	Peter Hachenberger	Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces.	Algorithmica	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.	Formal Aspects Comput.	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.	SAS	2002	DBLP DOI BibTeX RDF
85	Egon Schulte	Chiral Polyhedra in Ordinary Space, I.	Discret. Comput. Geom.	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.	GMP	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.	Formal Methods Syst. Des.	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'.	HICSS (2)	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.	SCG	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.	TACAS	2008	DBLP DOI BibTeX RDF
69	Peter Hachenberger	Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces.	ESA	2007	DBLP DOI BibTeX RDF
66	Mark de Berg, Mark H. Overmars	Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract)	FOCS	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.	Symposium on Solid and Physical Modeling	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.	GIScience	2008	DBLP DOI BibTeX RDF
65	Roberto Bagnara, Patricia M. Hill, Elisa Ricci 0002, Enea Zaffanella	Precise Widening Operators for Convex Polyhedra.	SAS	2003	DBLP DOI BibTeX RDF
65	Rebecca Alexander, Heather Dyson, Joseph O'Rourke	The Foldings of a Square to Convex Polyhedra.	JCDCG	2002	DBLP DOI BibTeX RDF
65	Olivier Bournez, Oded Maler	On the Representation of Timed Polyhedra.	ICALP	2000	DBLP DOI BibTeX RDF
65	Jean-Daniel Boissonnat, Mariette Yvinec	Probing a Scene of Non Convex Polyhedra.	SCG	1989	DBLP DOI BibTeX RDF
54	Haim Kaplan, Natan Rubin, Micha Sharir	Line transversals of convex polyhedra in R3.	SODA	2009	DBLP DOI BibTeX RDF
54	Egon Schulte	Chiral Polyhedra in Ordinary Space, II.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
54	Efi Fogel, Dan Halperin	Exact Minkowski sums of convex polyhedra.	SCG	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.	SCG	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.	JCDCG	2002	DBLP DOI BibTeX RDF
54	Basudeb Datta, Nandini Nilakantan	Equivelar Polyhedra with Few Vertices.	Discret. Comput. Geom.	2001	DBLP DOI BibTeX RDF
54	Jos B. T. M. Roerdink, Henk Bekker	Similarity Measure Computation of Convex Polyhedra Revisited.	Digital and Image Geometry	2000	DBLP DOI BibTeX RDF
54	Philippe Martin, Dominique Martin	PolyFormes: software for the declarative modelling of polyhedra.	Vis. Comput.	1999	DBLP DOI BibTeX RDF	Uniform polyhedron, Geometric modelling, Declarative modelling
54	Olivier Bournez, Oded Maler, Amir Pnueli	Orthogonal Polyhedra: Representation and Computation.	HSCC	1999	DBLP DOI BibTeX RDF
54	Branko Grünbaum	Realizations of Symmetric Maps by Symmetric Polyhedra.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
54	William C. Thibault, Bruce F. Naylor	Set operations on polyhedra using binary space partitioning trees.	SIGGRAPH	1987	DBLP DOI BibTeX RDF
51	Haim Kaplan, Natan Rubin, Micha Sharir	Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra.	Algorithmica	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.	SCG	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.	Discret. Comput. Geom.	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.	DGCI	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.	ISAAC	2001	DBLP DOI BibTeX RDF
50	Joseph S. B. Mitchell, Subhash Suri	Separation and Approximation of Polyhedral Objects.	SODA	1992	DBLP BibTeX RDF
50	Bruce F. Naylor, John Amanatides, William C. Thibault	Merging BSP trees yields polyhedral set operations.	SIGGRAPH	1990	DBLP DOI BibTeX RDF
47	Jim Morey, Kamran Sedig, Robert E. Mercer	Interactive Metamorphic Visuals: Exploring Polyhedral Relationships.	IV	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.	ACM Trans. Graph.	1998	DBLP DOI BibTeX RDF	collision detection, polyhedra
44	Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman	Straight Skeletons of Three-Dimensional Polyhedra.	ESA	2008	DBLP DOI BibTeX RDF
44	Liqian Chen, Antoine Miné, Patrick Cousot	A Sound Floating-Point Polyhedra Abstract Domain.	APLAS	2008	DBLP DOI BibTeX RDF
44	Peter McMullen	Four-Dimensional Regular Polyhedra.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
44	Axel Simon, Andy King	Widening Polyhedra with Landmarks.	APLAS	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.	SCG	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.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
44	Boting Yang, Cao An Wang	Minimal Tetrahedralizations of a Class of Polyhedra.	J. Comb. Optim.	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.	Math. Program.	2003	DBLP DOI BibTeX RDF
44	Jeff Erickson 0001	Local polyhedra and geometric graphs.	SCG	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.	SAS	2003	DBLP DOI BibTeX RDF
44	Federico Thomas, Carme Torras	A projectively invariant intersection test for polyhedra.	Vis. Comput.	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.	SCG	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.	GMP	2000	DBLP DOI BibTeX RDF	Voronoi Region, Computational Geometry, Distance Computation
44	Cao An Wang, Bo-Ting Yang	Tetrahedralization of Two Nested Convex Polyhedra.	COCOON	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.	IPCO	1999	DBLP DOI BibTeX RDF
44	Richard Lobb	Quasiconvolutional smoothing of polyhedra.	Vis. Comput.	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.	ECCV (1)	1996	DBLP DOI BibTeX RDF
44	Ammar Joukhadar, Ahmad Wabbi, Christian Laugier	Fast Contact Localization Between Deformable Polyhedra in Motion.	CA	1996	DBLP DOI BibTeX RDF	contact detection, virtual reality, interaction, Animation, physical modeling, deformable objects
44	Peter L. Williams	Visibility-Ordering Meshed Polyhedra.	ACM Trans. Graph.	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.	ICALP	1990	DBLP DOI BibTeX RDF
41	Eryk Kopczynski, Igor Pak, Piotr Przytycki	Acute triangulations of polyhedra and the Euclidean space.	SCG	2010	DBLP DOI BibTeX RDF	triangulations, polyhedra
41	ByungMoon Kim, Jarek Rossignac	Collision prediction for polyhedra under screw motions.	Symposium on Solid Modeling and Applications	2003	DBLP DOI BibTeX RDF	screw motion, collision detection, polyhedra
41	Lefteris M. Kirousis	Effectively Labeling Planar Projections of Polyhedra.	IEEE Trans. Pattern Anal. Mach. Intell.	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.	PPoPP	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.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	sequential convexification, 0-1 programming, disjunctive programming, lift-and-project
40	Egon Balas	Projection and Lifting in Combinatorial Optimization.	Computational Combinatorial Optimization	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.	Vis. Comput.	1999	DBLP DOI BibTeX RDF	Surface decomposition, 3D polyhedral morphing, Animation, Geometric features, Metamorphosis
40	Branko Grünbaum	Isogonal Prismatoids.	Discret. Comput. Geom.	1997	DBLP DOI BibTeX RDF
37	Goran Frehse	PHAVer: algorithmic verification of hybrid systems past HyTech.	Int. J. Softw. Tools Technol. Transf.	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.	Automated Deduction in Geometry	2004	DBLP DOI BibTeX RDF	Structural Reconstruction, Grassmann-Cayley Algebra, Local Propagation, Polyhedra, Geometric Reconstruction
37	Marc Alexa	Merging Polyhedral Shapes with Scattered Features.	Shape Modeling International	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.	ICCV	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.	PDP	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.	Optim. Lett.	2007	DBLP DOI BibTeX RDF	Dominating set conjecture, Metric polyhedra, Cut polyhedra
34	Jean François Maurras	A family of easy polyhedra.	4OR	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.	SAS	2009	DBLP DOI BibTeX RDF
34	Ezra Miller, Igor Pak	Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF
34	Mark de Berg, Chris Gray	Decompositions and Boundary Coverings of Non-convex Fat Polyhedra.	ESA	2008	DBLP DOI BibTeX RDF
34	Sriram Sankaranarayanan 0001, Thao Dang 0001, Franjo Ivancic	A Policy Iteration Technique for Time Elapse over Template Polyhedra.	HSCC	2008	DBLP DOI BibTeX RDF
34	Claudio Mirolo, Stefano Carpin, Enrico Pagello	Incremental Convex Minimization for Computing Collision Translations of Convex Polyhedra.	IEEE Trans. Robotics	2007	DBLP DOI BibTeX RDF
34	Esther Ezra, Micha Sharir	A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R3.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
34	Károly Bezdek, Zsolt Lángi, Márton Naszódi, Peter Papez	Ball-Polyhedra.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
34	Károly Bezdek	From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams.	ISVD	2007	DBLP DOI BibTeX RDF
34	Haim Kaplan, Natan Rubin, Micha Sharir	Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra.	ESA	2007	DBLP DOI BibTeX RDF
34	Dennis Michaels, Robert Weismantel	Polyhedra related to integer-convex polynomial systems.	Math. Program.	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.	Vis. Comput.	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.	STACS	2006	DBLP DOI BibTeX RDF
34	Esther Ezra	Almost tight bound for a single cell in an arrangement of convex polyhedra in R3.	SCG	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.	CORES	2005	DBLP DOI BibTeX RDF
34	Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz	Efficient View Point Selection for Silhouettes of Convex Polyhedra.	MFCS	2004	DBLP DOI BibTeX RDF
34	Peter W. Messer	Closed-Form Expressions for Uniform Polyhedra and Their Duals.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
34	Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang	Approximation for minimum triangulation of convex polyhedra.	SODA	2001	DBLP BibTeX RDF
34	Eva Dyllong, Wolfram Luther, Werner Otten	An Accurate Distance-Calculation Algorithm for Convex Polyhedra.	Reliab. Comput.	1999	DBLP DOI BibTeX RDF
34	Pierre Boulet, Paul Feautrier	Scanning Polyhedra without Do-loops.	IEEE PACT	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.	SCG	1989	DBLP DOI BibTeX RDF
34	Chandrajit L. Bajaj, Tamal K. Dey	Robust Decompositions of Polyhedra.	FSTTCS	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.	Shape Modeling International	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.	WALCOM	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.	SCG	2007	DBLP DOI BibTeX RDF	complexity, convex, polyhedra, Minkowski sum
31	Herbert Edelsbrunner	Algebraic Decompositions of Non-Convex Polyhedra.	FOCS	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.	Symposium on Solid Modeling and Applications	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	FOCS	1993	DBLP DOI BibTeX RDF	union of convex polyhedra, almost tight, edges, faces, vertices, three dimensions, randomized incremental algorithm