Search results for "polyhedra"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
31	Alexander I. Barvinok	A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed	FOCS	1993	DBLP DOI BibTeX RDF	d-dimensional Euclidean space, integral points counting, polynomial time algorithm, polyhedra
31	Bernard Chazelle	An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra (Detailed Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	Voronoi diagrams, convex hull, optimal algorithm, intersecting, three-dimensional, convex polyhedra
30	Seok-Hee Hong 0001, Hiroshi Nagamochi	Upward Star-Shaped Polyhedral Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF
30	Nilanjan Chakraborty, Jufeng Peng, Srinivas Akella, Jason E. Mitchell	Proximity Queries Between Convex Objects: An Interior Point Approach for Implicit Surfaces.	IEEE Trans. Robotics	2008	DBLP DOI BibTeX RDF
30	Eric J. Griffith, Michal Koutek, Frits H. Post	Fast normal vector compression with bounded error.	Symposium on Geometry Processing	2007	DBLP DOI BibTeX RDF
30	Hans-Joachim Klein 0001	Retrieval of Isomorphic Substructures in Crystallographic Databases.	SSDBM	2004	DBLP DOI BibTeX RDF
28	Seok-Hee Hong 0001, Hiroshi Nagamochi	Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra.	Algorithmica	2011	DBLP DOI BibTeX RDF
28	Hidetoshi Nonaka	Detection of Faces in Wire-Frame Polyhedra - Interactive Modelling of Uniform Polyhedra.	GRAPP	2008	DBLP BibTeX RDF
28	Branko Grünbaum	Graphs of polyhedra; polyhedra as graphs.	Discret. Math.	2007	DBLP DOI BibTeX RDF
28	Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara	Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2.	Discret. Math.	2004	DBLP DOI BibTeX RDF
27	Sanjeeb Dash, Oktay Günlük	On the strength of Gomory mixed-integer cuts as group cuts.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mixed integer rounding, Cyclic group polyhedra, Integer programming, Cutting planes
27	Roberto Bagnara, Patricia M. Hill, Enea Zaffanella	Widening operators for powerset domains.	Int. J. Softw. Tools Technol. Transf.	2006	DBLP DOI BibTeX RDF	Abstract domain refinement, Powersets, Widening operators, Abstract interpretation, Convex polyhedra
27	Alper Atamtürk	Cover and Pack Inequalities for (Mixed) Integer Programming.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	knapsack polyhedra, superadditive functions, integer programming, lifting
27	Matteo Fischetti, Cristiano Saturni	Mixed-Integer Cuts from Cyclic Groups.	IPCO	2005	DBLP DOI BibTeX RDF	Subadditive cuts, Gomory cuts, Gyclic Group and Corner polyhedra, Mixed-Integer Programming
27	Martin Reuter 0001, Franz-Erich Wolter, Niklas Peinecke	Laplace-spectra as fingerprints for shape matching.	Symposium on Solid and Physical Modeling	2005	DBLP DOI BibTeX RDF	parameterized surfaces and bodies, shape invariants, fingerprints, copyright protection, shape matching, NURBS, polyhedra, database retrieval, laplace-beltrami operator
27	Olaf Stursberg, Bruce H. Krogh	Efficient Representation and Computation of Reachable Sets for Hybrid Systems.	HSCC	2003	DBLP DOI BibTeX RDF	Hybrid Dynamic Systems, Hyperrectangles, Model Checking, Singular Value Decomposition, Convex Hull, Polyhedra
27	Vincent Loechner, Benoît Meister, Philippe Clauss	Data Sequence Locality: A Generalization of Temporal Locality.	Euro-Par	2001	DBLP DOI BibTeX RDF	cache and TLB performance, parameterized polyhedra, Ehrhart polynomials, Memory hierarchy, temporal locality, loop nests
27	Marc Alexa	Merging polyhedral shapes with scattered features.	Vis. Comput.	2000	DBLP DOI BibTeX RDF	Scattered features, Morphing, Polyhedra
27	Luis Arturo Perez Lozada, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi	Visualization of Three-Dimensional Maps.	SIBGRAPI	2000	DBLP DOI BibTeX RDF	three-dimensional map visualization, 3D manifold, topological polyhedra, combinatorial description, geometric realization, aesthetic criteria, R/sup 3/, multi-celled solid object, specialized rendering techniques, data visualization, data visualisation, energy functions
27	Takashi Kanai, Hiromasa Suzuki, Fumihiko Kimura	3D geometric metamorphosis based on harmonic map.	PG	1997	DBLP DOI BibTeX RDF	3D geometric metamorphosis, arbitrary polyhedra, three dimensional sphere, two dimensional disk, object correspondence, boundary loop, animations, computational geometry, graphical user interface, computer graphics, interpolation, deforming objects, shape transformation, graph structure, image morphing, three dimensional objects, harmonic map
27	Aldo Laurentini	Comments on "Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects".	IEEE Trans. Pattern Anal. Mach. Intell.	1996	DBLP DOI BibTeX RDF	topological definition of aspect, polyhedra, Aspect graphs
27	Alberto Paoluzzi, Valerio Pascucci, Michele Vicentino	Geometric Programming: A Programming Approach to Geometric Design.	ACM Trans. Graph.	1995	DBLP DOI BibTeX RDF	variational geometry, functional programming, solid modeling, generative modeling, polyhedra, design language, geometric design
27	Frank Klingspor, Dietmar Luhofer, Thomas Rottke	Parallel Searching for 3D-Objects.	CONPAR	1992	DBLP DOI BibTeX RDF	geometric searching, parallel topological B*-Trees, polyhedra intersections, minimal distance, data distribution
27	Michel Dhome, Marc Richetin, Jean-Thierry Lapresté, Gérard Rives	Determination of the Attitude of 3D Objects from a Single Perspective View.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	attitude determination, image line triplet, single perspective view, prediction-verification procedure, pattern recognition, pattern recognition, object recognition, picture processing, picture processing, interpolation, polyhedra, 3D object, geometrical transformations, spatial variables measurement
24	Victor Milenkovic, Elisha Sacks, Min-Ho Kyung	Robust Minkowski sums of polyhedra via controlled linear perturbation.	Symposium on Solid and Physical Modeling	2010	DBLP DOI BibTeX RDF	perturbation methods, robust computational geometry
24	Kiavash Kianfar, Yahya Fathi	Generalized mixed integer rounding inequalities: facets for infinite group polyhedra.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C11, 90C57, 90C10
24	Gennadiy Averkov, Martin Henk	Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	?ojasiewicz’s inequality, Theorem of Bröcker and Scheiderer, Polynomial, Polytope, Semi-algebraic set
24	Therese C. Biedl, Burkay Genç	Cauchy's Theorem for Orthogonal Polyhedra of Genus 0.	ESA	2009	DBLP DOI BibTeX RDF
24	Christoph Scholl 0001, Stefan Disch, Florian Pigorsch, Stefan Kupferschmid	Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints.	TACAS	2009	DBLP DOI BibTeX RDF
24	Philip J. Charles, Jacob M. Howe, Andy King	Integer Polyhedra for Program Analysis.	AAIM	2009	DBLP DOI BibTeX RDF
24	Michele Conforti, Laurence A. Wolsey	Compact formulations as a union of polyhedra.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C11
24	Xavier Allamigeon, Stephane Gaubert, Eric Goubault	Inferring Min and Max Invariants Using Max-Plus Polyhedra.	SAS	2008	DBLP DOI BibTeX RDF
24	Sorin Olaru, Ioan Dumitrache, Didier Dumur	Geometrical Analysis of Model Predictive Control: A Parameterized Polyhedra Approach.	NAA	2008	DBLP DOI BibTeX RDF
24	Chao Wang 0001, Zijiang Yang 0006, Aarti Gupta, Franjo Ivancic	Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra.	CAV	2007	DBLP DOI BibTeX RDF
24	Claudio Mirolo, Stefano Carpin, Enrico Pagello	Exploring Different Coherence Dimensions to Answer Proximity Queries for Convex Polyhedra.	ICRA	2007	DBLP DOI BibTeX RDF
24	Sanjeeb Dash, Oktay Günlük, Andrea Lodi 0001	On the MIR Closure of Polyhedra.	IPCO	2007	DBLP DOI BibTeX RDF
24	Therese C. Biedl, Anna Lubiw, Michael J. Spriggs	Cauchy's Theorem and Edge Lengths of Convex Polyhedra.	WADS	2007	DBLP DOI BibTeX RDF
24	Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz	Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections.	FSTTCS	2007	DBLP DOI BibTeX RDF
24	Bojan Mohar	Bar-Magnet Polyhedra and NS-Orientations of Maps.	Discret. Comput. Geom.	2006	DBLP DOI BibTeX RDF
24	Erik D. Demaine	Origami, Linkages, and Polyhedra: Folding with Algorithms.	ESA	2006	DBLP DOI BibTeX RDF
24	Abdullah Bade, Norhaida Mohd. Suaib, Abdullah Mohd Zin, Tengku M. T. Sembok	Oriented convex polyhedra for collision detection in 3D computer animation.	GRAPHITE	2006	DBLP DOI BibTeX RDF	virtual environments, collision detection, bounding volumes
24	Hartwig Bosse, Martin Grötschel, Martin Henk	Polynomial inequalities representing polyhedra.	Math. Program.	2005	DBLP DOI BibTeX RDF
24	Jean-Marc Schlenker	A Rigidity Criterion for Non-Convex Polyhedra.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
24	Martin C. Cooper	Wireframe Projections: Physical Realisability of Curved Objects and Unambiguous Reconstruction of Simple Polyhedra.	Int. J. Comput. Vis.	2005	DBLP DOI BibTeX RDF	wireframe model, hidden-line drawing, physical realisability, impossible object, Necker cube, Penrose triangle
24	Siu-Wing Cheng, Tamal K. Dey, Tathagata Ray	Weighted Delaunay Refinement for Polyhedra with Small Angles.	IMR	2005	DBLP DOI BibTeX RDF	computational geometry, mesh generation, Delaunay refinement, sliver, weighted Delaunay triangulation
24	Roberto Bagnara, Enric Rodríguez-Carbonell, Enea Zaffanella	Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra.	SAS	2005	DBLP DOI BibTeX RDF
24	Michelangelo Conforti, Romeo Rizzi	Combinatorial optimization - Polyhedra and efficiency: A book review.	4OR	2004	DBLP DOI BibTeX RDF	Combinatorial optimization, integer programming, polyhedral combinatorics
24	Louis Latour	From Automata to Formulas: Convex Integer Polyhedra.	LICS	2004	DBLP DOI BibTeX RDF
24	Therese C. Biedl, Anna Lubiw, Michael J. Spriggs	Angles and Lengths in Reconfigurations of Polygons and Polyhedra.	MFCS	2004	DBLP DOI BibTeX RDF
24	Frédéric Maire	An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines.	ICDM	2003	DBLP DOI BibTeX RDF
24	Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll	Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems.	DMTCS	2003	DBLP DOI BibTeX RDF
24	Sumanta Guha	Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra.	FSTTCS	2003	DBLP DOI BibTeX RDF
24	Ioannis P. Ivrissimtzis, Hans-Peter Seidel	Polyhedra Operators for Mesh Refinement.	GMP	2002	DBLP DOI BibTeX RDF
24	Gérard Cornuéjols, Yanjun Li	On the Rank of Mixed 0, 1 Polyhedra.	IPCO	2001	DBLP DOI BibTeX RDF
24	Henk Bekker, Jos B. T. M. Roerdink	An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra.	International Conference on Computational Science (1)	2001	DBLP DOI BibTeX RDF
24	Kokichi Sugihara	Resolvable Representation of Polyhedra.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
24	Marek Karpinski	Randomized Complexity of Linear Arrangements and Polyhedra.	FCT	1999	DBLP DOI BibTeX RDF
24	Alexander Martin 0001, Robert Weismantel	The Intersection of Knapsack Polyhedra and Extensions.	IPCO	1998	DBLP DOI BibTeX RDF
24	Xiaoyi Jiang 0001, Keren Yu, Horst Bunke	Detection of rotational and involutional symmetries and congruity of polyhedra.	Vis. Comput.	1996	DBLP DOI BibTeX RDF	Congruity problem, Computational geometry, Graph theory, Algorithm design, Symmetry detection
24	Prosenjit Bose, David Bremner, Marc J. van Kreveld	Determining the Castability of Simple Polyhedra.	SCG	1994	DBLP DOI BibTeX RDF
24	Kokichi Sugihara	Topologically Consistent Algorithms Realted to Convex Polyhedra.	ISAAC	1992	DBLP DOI BibTeX RDF
24	Michael B. Dillencourt, Warren D. Smith	A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra.	SCG	1992	DBLP DOI BibTeX RDF
24	Charles W. Grant	Integrated analytic spatial and temporal anti-aliasing for polyhedra in 4-space.	SIGGRAPH	1985	DBLP DOI BibTeX RDF	scan-line algorithms, temporal anti-aliasing, visible surface algorithms, anti-aliasing, motion blur, filtering algorithms
20	Gunther Reißig	Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems.	HSCC	2009	DBLP DOI BibTeX RDF
20	András Sebö	Path Partitions, Cycle Covers and Integer Decomposition.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF
20	Vincent Laviron, Francesco Logozzo	SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities.	VMCAI	2009	DBLP DOI BibTeX RDF
20	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich	Generating All Vertices of a Polyhedron Is Hard.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF
20	Shuning Wang, Xiaolin Huang, Junaid M. Khan	Configuration of Continuous Piecewise-Linear Neural Networks.	IEEE Trans. Neural Networks	2008	DBLP DOI BibTeX RDF
20	Ulrich Faigle, Britta Peis	Two-phase greedy algorithms for some classes of combinatorial linear programs.	SODA	2008	DBLP BibTeX RDF
20	Morgan Magnin, Didier Lime, Olivier H. Roux	Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper).	Petri Nets	2008	DBLP DOI BibTeX RDF	Verification using nets, symbolic state space, Time Petri nets, discrete-time, dense-time, stopwatches
20	Xijuan Guo, Lei Xie, Yongliang Gao	Optimal Accurate Minkowski Sum Approximation of Polyhedral Models.	ICIC (1)	2008	DBLP DOI BibTeX RDF	Non-convex polyhera, Regular-tetrahedron Gaussian Map, Computational geometry, Minkowski sum, Swept volume
20	Christophe Alias, Fabrice Baray, Alain Darte	Bee+Cl@k: an implementation of lattice-based array contraction in the source-to-source translator rose.	LCTES	2007	DBLP DOI BibTeX RDF	program analysis, lattices, source-to-source transformations, memory reduction
20	Helmut Seidl, Andrea Flexeder, Michael Petter	Interprocedurally Analysing Linear Inequality Relations.	ESOP	2007	DBLP DOI BibTeX RDF
20	Gautam Gupta, DaeGon Kim, Sanjay V. Rajopadhye	Scheduling in the Z-Polyhedral Model.	IPDPS	2007	DBLP DOI BibTeX RDF
20	Ewgenij Gawrilow, Michael Joswig	Flexible Object Hierarchies in Polymake.	ICMS	2006	DBLP DOI BibTeX RDF
20	Marc Glisse	An upper bound on the average size of silhouettes.	SCG	2006	DBLP DOI BibTeX RDF	upper bound, silhouette, polyhedron
20	Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell	Algorithms for two-box covering.	SCG	2006	DBLP DOI BibTeX RDF	exact and approximate algorithms
20	Corneliu Popeea, Wei-Ngan Chin	Inferring Disjunctive Postconditions.	ASIAN	2006	DBLP DOI BibTeX RDF
20	Goran Frehse	PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech.	HSCC	2005	DBLP DOI BibTeX RDF
20	Richard Cook, Nelson L. Max, Cláudio T. Silva, Peter L. Williams	Image-Space Visibility Ordering for Cell Projection Volume Rendering of Unstructured Data.	IEEE Trans. Vis. Comput. Graph.	2004	DBLP DOI BibTeX RDF	Volume rendering, unstructured mesh, visibility ordering
20	Ralph E. Gomory, Ellis L. Johnson	T-space and cutting planes.	Math. Program.	2003	DBLP DOI BibTeX RDF
20	Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel	Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation.	ESA	2003	DBLP DOI BibTeX RDF
20	Bernard Chazelle, Ding Liu, Avner Magen	Sublinear geometric algorithms.	STOC	2003	DBLP DOI BibTeX RDF	approximate shortest paths, polyhedral intersection, sublinear algorithms
20	Tuba Yavuz-Kahveci, Tevfik Bultan	Heuristics for Efficient Manipulation of Composite Constraints.	FroCoS	2002	DBLP DOI BibTeX RDF
20	Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack	Approximating Shortest Paths on Weighted Polyhedral Surfaces.	Algorithmica	2001	DBLP DOI BibTeX RDF
20	Satoru Fujishige, Satoru Iwata 0001	Bisubmodular Function Minimization.	IPCO	2001	DBLP DOI BibTeX RDF
20	Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram	A Decomposition-Based Approach to Layered Manufacturing.	WADS	2001	DBLP DOI BibTeX RDF
20	Friedrich Eisenbrand, Andreas S. Schulz	Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.	IPCO	1999	DBLP DOI BibTeX RDF
20	Frédéric Besson, Thomas P. Jensen, Jean-Pierre Talpin	Polyhedral Analysis for Synchronous Languages.	SAS	1999	DBLP DOI BibTeX RDF
20	Avner Shapiro, Ayellet Tal	Polyhedron realization for shape transformation.	Vis. Comput.	1998	DBLP DOI BibTeX RDF	Polyhedron realization, Correspondence, Metamorphosis, Shape transformation
20	Grigor Gasparyan	Bipartite Designs.	IPCO	1998	DBLP DOI BibTeX RDF
20	Jingling Xue	Constructing DO loops for non-convex iteration spaces in compiling for parallel machines.	IPPS	1995	DBLP DOI BibTeX RDF	DO loops, nonconvex iteration spaces, parallel machines compiling, index points, communication code, code generation problems, code generation, program compilers, shared memory systems, distributed memory systems, data transfer, nested loops, lexicographical order, convex polyhedron
20	David Baraff	Curved surfaces and coherence for non-penetrating rigid body simulation.	SIGGRAPH	1990	DBLP DOI BibTeX RDF
20	Otto Nurmi, Jörg-Rüdiger Sack	Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract).	WG	1988	DBLP DOI BibTeX RDF
20	David P. Dobkin, Leonidas J. Guibas, John Hershberger 0001, Jack Snoeyink	An efficient algorithm for finding the CSG representation of a simple polygon.	SIGGRAPH	1988	DBLP DOI BibTeX RDF	boundary-to-CSG conversion algorithms, solid modeling, constructive solid geometry, simple polygons
20	L. W. Brinn	A polygon matching problem in computer vision (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
17	Salvatore Ruggieri, Fred Mesnard	Variable ranges in linear constraints.	SAC	2010	DBLP DOI BibTeX RDF	parameterized polyhedra, interval arithmetic, constraint logic programming, linear constraints
17	Katta G. Murty	Complexity of Degeneracy.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Near degeneracy, Active constraints, Tight constraints, Inactive constraints, Slack constraints, Basic feasible solution, Regular polyhedron, Simple polyhedron, Stalling, Resolving degeneracy, Positive marginal values, Negative marginal values, Extreme point enumeration, Extreme point ranking, Assignment ranking, Segments of polyhedra, NP-complete problem, Cycling, Degeneracy, Active set methods, Nondegeneracy
17	Tobias Gerken	Empty Convex Hexagons in Planar Point Sets.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Erd?s-Szekeres problem, Convex polygons and polyhedra, Empty hexagon problem, Ramsey theory
17	Jean-Marc Schlenker	Circle Patterns on Singular Surfaces.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Circle patterns, Hyperideal polyhedra, Hyperbolic geometry