Search results for "polyhedron"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
98	Michael A. Penna	A Shape From Shading Analysis for a Single Perspective Image of a Polyhedron.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	shape from shading analysis, single perspective image, pattern recognition, pattern recognition, computational geometry, picture processing, picture processing, algebra, polyhedron, light source, algebraic equations
88	Avner Shapiro, Ayellet Tal	Polyhedron realization for shape transformation.	Vis. Comput.	1998	DBLP DOI BibTeX RDF	Polyhedron realization, Correspondence, Metamorphosis, Shape transformation
86	Ivana Kolingerová	Convex polyhedron-line intersection detection using dual representation.	Vis. Comput.	1997	DBLP DOI BibTeX RDF	Intersection detection, Dual representation, Line-polyhedron intersection, Computer graphics, Convex polyhedron
75	Walter Whiteley	How to describe or design a polyhedron.	J. Intell. Robotic Syst.	1994	DBLP DOI BibTeX RDF	Combinatorial polyhedron, spatial polyhedron, relization, edge length, dihedral angle, construction, geometric representation
69	Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük	On a Generalization of the Master Cyclic Group Polyhedron.	IPCO	2007	DBLP DOI BibTeX RDF	integer programming, polyhedral combinatorics
65	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich	Generating all vertices of a polyhedron is hard.	SODA	2006	DBLP DOI BibTeX RDF	enumeration problem, facet enumeration, feasible system, negative cycle, polytope-polyhedron problem, vertex enumeration, graph, cycle, face, polytope, polyhedron, facet, vertex, linear inequalities
62	Rajeev Alur, Sampath Kannan, Salvatore La Torre	Polyhedral Flows in Hybrid Automata.	Formal Methods Syst. Des.	2004	DBLP DOI BibTeX RDF	polyhedral dynamics, hybrid systems, reachability analysis
62	Jean Françon, Laurent Papier	Polyhedrization of the Boundary of a Voxel Object.	DGCI	1999	DBLP DOI BibTeX RDF
62	Joseph S. B. Mitchell, Subhash Suri	Separation and Approximation of Polyhedral Objects.	SODA	1992	DBLP BibTeX RDF
59	Tomoya Kubo, Yusuke Kobayashi 0007, Ahmad Athif Mohd Faudzi, Koichi Suzumori	Development of Active 80-faced Polyhedron for haptic physical human-machine interface.	IROS	2009	DBLP DOI BibTeX RDF
59	Gregory G. Slabaugh, Gozde B. Unal	Active Polyhedron: Surface Evolution Theory Applied to Deformable Meshes.	CVPR (2)	2005	DBLP DOI BibTeX RDF
55	Michal Etzion, Ari Rappoport	Computing the Voronoi diagram of a 3-D polyhedron by separate computation of its symbolic and geometric parts.	Symposium on Solid Modeling and Applications	1999	DBLP DOI BibTeX RDF	Voronoi diagram of a polyhedron, Voronoi graph, medial axis of a polyhedron, Voronoi diagram
55	Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.	Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees.	FOCS	1995	DBLP DOI BibTeX RDF	algebraic decision trees, n-dimensional convex polyhedron, naturally appearing polyhedra, computational geometry, lower bound, lower bounds, decision theory, polyhedron, membership testing
51	Chuankai Liu, Hong Qiao, Bo Zhang 0006	A new practical strategy to localize a 3D object without sensors.	IROS	2009	DBLP DOI BibTeX RDF
51	Wencheng Wang, Jing Li, Hanqiu Sun, Enhua Wu	Layer-Based Representation of Polyhedrons for Point Containment Tests.	IEEE Trans. Vis. Comput. Graph.	2008	DBLP DOI BibTeX RDF
51	L. W. Brinn	A polygon matching problem in computer vision (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
49	Lajos Szilassi	A Polyhedral Model in Euclidean 3-Space of the Six-Pentagon Map of the Projective Plane.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Model of the real projective plane, Möbius strip, Polyhedron
49	Marc Glisse	An upper bound on the average size of silhouettes.	SCG	2006	DBLP DOI BibTeX RDF	upper bound, silhouette, polyhedron
49	Jun Yang, Dili Zhang, Noboru Ohnishi, Noboru Sugie	Determining a Polyhedral Shape Using Interreflections.	CVPR	1997	DBLP DOI BibTeX RDF	computer vision, shape from shading, shape recovery, polyhedron, interreflections
49	Tsau Young Lin, Mong-Hang Vo	Granular Computing: Modeling Human Thoughts in the Web by Polyhedron.	WImBI	2006	DBLP DOI BibTeX RDF
49	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
41	Daniel Kane 0001, Gregory N. Price, Erik D. Demaine	A Pseudopolynomial Algorithm for Alexandrov's Theorem.	WADS	2009	DBLP DOI BibTeX RDF
41	Jie Chen 0007, Baoquan Chen	Architectural Modeling from Sparsely Scanned Range Data.	Int. J. Comput. Vis.	2008	DBLP DOI BibTeX RDF	Geometry reconstruction, Range image, 3D scanning
41	Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman	Straight Skeletons of Three-Dimensional Polyhedra.	ESA	2008	DBLP DOI BibTeX RDF
41	Mourad Ahmane, Laurent Truffet	State Feedback Control via Positive Invariance for Max-plus Linear Systems using *-algorithm.	ETFA	2006	DBLP DOI BibTeX RDF
41	Jim Ruppert, Raimund Seidel	On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra.	SCG	1989	DBLP DOI BibTeX RDF
39	David Eppstein, Elena Mumford	Steinitz theorems for orthogonal polyhedra.	SCG	2010	DBLP DOI BibTeX RDF	Steinitz theorem, orthogonal polyhedron, planar graph
39	Marc Glisse, Sylvain Lazard	An Upper Bound on the Average Size of Silhouettes.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Apparent boundary, Contour generator, Profile, Upper bound, Silhouette, Polyhedron, Average, Rim
39	Valentin E. Brimkov, Reneta P. Barneva	Polyhedrization of Discrete Convex Volumes.	ISVC (1)	2006	DBLP DOI BibTeX RDF	reversible polyhedrization, polyhedron decomposition, discrete geometry
39	Valeriu Beiu	Enhanced lower entropy bounds with application to constructive learning.	EUROMICRO	1997	DBLP DOI BibTeX RDF	enhanced lower entropy bounds, IR/sup n/, constructive learning algorithms, n dimensional ball, integer weights, maximum volume, n dimensional cones, neural networks, neural nets, upper bounding, polyhedron, logarithm, classification problems, quotient
39	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
39	Doran Wilde, Sanjay V. Rajopadhye	The naive execution of affine recurrence equations.	ASAP	1995	DBLP DOI BibTeX RDF	algorithmic languages, regular arrays, ALPHA language, computer aided design methodology, regular array architectures, algorithmic specification, imperative sequential language C, applicative caching, 1-dimensional storage, formal specification, circuit CAD, hardware description languages, nested loops, polyhedron, transformational approach, C-code, affine recurrence equations
39	Jae-Sook Cheong, A. Frank van der Stappen	Computing all form-closure grasps of a rectilinear polyhedron with seven frictionless point fingers.	IROS	2007	DBLP DOI BibTeX RDF
39	Jianfei Liu, Shuli Sun	Small Polyhedron Reconnection: A New Way to Eliminate Poorly-Shaped Tetrahedra.	IMR	2006	DBLP DOI BibTeX RDF
39	Xiaolin Lu	An Algorithm for Rendering Vertexes and Edges of Polyhedron with High Order Geometric Continuity.	ICCSA (1)	2006	DBLP DOI BibTeX RDF
39	Volker Leeb, Ludwig M. Auer, Arne Radetzky	Interactive Texturing by Polyhedron Decomposition.	VR	2001	DBLP DOI BibTeX RDF
39	Bernard Chazelle, Leonidas Palios	Decomposing the Boundary of a Nonconvex Polyhedron.	SWAT	1992	DBLP DOI BibTeX RDF
39	Jindong Chen, Yijie Han	Storing Shortest Paths for a Polyhedron.	ICCI	1991	DBLP DOI BibTeX RDF
37	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
36	Hichem Barki, Florence Denis, Florent Dupont	Contributing vertices-based Minkowski sum of a non-convex polyhedron without fold and a convex polyhedron.	Shape Modeling International	2009	DBLP DOI BibTeX RDF
31	Mark de Berg, Chris Gray	Decompositions and Boundary Coverings of Non-convex Fat Polyhedra.	ESA	2008	DBLP DOI BibTeX RDF
31	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
31	Sheung-Hung Poon	On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees.	COCOON	2008	DBLP DOI BibTeX RDF
31	Ying Deng, Jie Zhou	LPV H-infinity Controller Design for a Wind Power Generator.	RAM	2008	DBLP DOI BibTeX RDF
31	Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis	On the graphical relaxation of the symmetric traveling salesman polytope.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52B12, 52B55, 90C27
31	Sanjeeb Dash, Oktay Günlük, Andrea Lodi 0001	On the MIR Closure of Polyhedra.	IPCO	2007	DBLP DOI BibTeX RDF
31	Therese C. Biedl, Anna Lubiw, Michael J. Spriggs	Cauchy's Theorem and Edge Lengths of Convex Polyhedra.	WADS	2007	DBLP DOI BibTeX RDF
31	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
31	David Orden, Francisco Santos	The Polytope of Non-Crossing Graphs on a Planar Point Set.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
31	Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine	Hinged Dissection of Polypolyhedra.	WADS	2005	DBLP DOI BibTeX RDF
31	Yannick L. Kergosien	Adaptive Trees and Pose Identification from External Contours of Polyhedra.	DSSCV	2005	DBLP DOI BibTeX RDF
31	Hiroo Iwata	Full-Surround Image Display Technologies.	Int. J. Comput. Vis.	2004	DBLP DOI BibTeX RDF	polyhedral screen, spherical screen, virtual reality, immersive projection display
31	Günter M. Ziegler	Random monotone paths on polyhedra.	SCG	2004	DBLP DOI BibTeX RDF
31	Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar	Short-Cuts on Star, Source and Planar Unfoldings.	FSTTCS	2004	DBLP DOI BibTeX RDF
31	David Orden, Francisco Santos	The polytope of non-crossing graphs on a planar point set.	ISSAC	2004	DBLP DOI BibTeX RDF	non-crossing graphs, polytope
31	Friedrich Eisenbrand, Andreas S. Schulz	Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 52B05, 90C27, 68Q17, 90C57, 90C10, 90C60
31	Imre Bárány, Krystyna Trybulec Kuperberg, Tudor Zamfirescu	Total Curvature and Spiralling Shortest Paths.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF	Total curvature, Spiralling number, Shortest path, Convex
31	Jan Sijbers, Dirk Van Dyck	Efficient algorithm for the computation of 3D Fourier descriptors.	3DPVT	2002	DBLP DOI BibTeX RDF
31	Itsuo Kumazawa, Masayoshi Ohno	3D Shape Reconstruction from Multiple Silhouettes: Generalization from Few Views by Neural Network Learning.	IWVF	2001	DBLP DOI BibTeX RDF
31	John Iacono, Stefan Langerman	Volume Queries in Polyhedra.	JCDCG	2000	DBLP DOI BibTeX RDF
31	Friedrich Eisenbrand, Andreas S. Schulz	Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.	IPCO	1999	DBLP DOI BibTeX RDF
31	Elena Kartasheva	The Algorithm for Automatic Cutting of Three-Dimensional Polyhedrons of h-Genus.	Shape Modeling International	1999	DBLP DOI BibTeX RDF
31	Mihaly Agfalvi, Istvan Kadar, Erik Papp	Generalization of Pick's theorem for surface of polyhedra.	APL	1999	DBLP DOI BibTeX RDF	APL
31	Idzhad Kh. Sabitov	The Volume as a Metric Invariant of Polyhedra.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
31	Alexander Martin 0001, Robert Weismantel	The Intersection of Knapsack Polyhedra and Extensions.	IPCO	1998	DBLP DOI BibTeX RDF
31	Prosenjit Bose, David Bremner, Marc J. van Kreveld	Determining the Castability of Simple Polyhedra.	SCG	1994	DBLP DOI BibTeX RDF
31	Paul W. Goldberg, Sally A. Goldman, H. David Mathias	Learning Unions of Boxes with Membership and Equivalence Queries.	COLT	1994	DBLP DOI BibTeX RDF
31	David M. Mount	Storing the Subdivision of a Polyhedral Surface.	SCG	1986	DBLP DOI BibTeX RDF
31	David P. Dobkin, David G. Kirkpatrick	Fast Detection of Polyhedral Intersections.	ICALP	1982	DBLP DOI BibTeX RDF
29	Armin Größlinger	Precise Management of Scratchpad Memories for Localising Array Accesses in Scientific Codes.	CC	2009	DBLP DOI BibTeX RDF	software-managed data cache, array localisation, polyhedron model, embedded systems, scratchpad memory
29	Guoli Ding, Li Feng 0001, Wenan Zang	The complexity of recognizing linear systems with certain integrality properties.	Math. Program.	2008	DBLP DOI BibTeX RDF	Total dual integrality, NP-hardness, Linear system, Polyhedron
29	Matthias Jach, Matthias Köppe, Robert Weismantel	Nondecomposable solutions to group equations and an application to polyhedral combinatorics.	4OR	2006	DBLP DOI BibTeX RDF	Gomory corner polyhedron, irreducible group solutions, simultaneous lifting
29	Guillaume Gardey, Didier Lime, Morgan Magnin, Olivier H. Roux	Romeo: A Tool for Analyzing Time Petri Nets.	CAV	2005	DBLP DOI BibTeX RDF	scheduling, model-checking, Time Petri nets, state-space, polyhedron, stopwatch, DBM
29	Syng-Yup Ohn	Neighborhood Decomposition of 3D Convex Structuring Elements for Morphological Operations.	CAIP	2005	DBLP DOI BibTeX RDF	decomposition, mathematical morphology, dilation, erosion, structuring element, convex polyhedron
29	Syng-Yup Ohn	Decomposition of 3D Convex Structuring Element in Morphological Operation for Parallel Processing Architectures.	ICIAR	2005	DBLP DOI BibTeX RDF	decomposition, mathematical morphology, dilation, erosion, structuring element, convex polyhedron
29	Boting Yang, Cao An Wang	Minimal Tetrahedralizations of a Class of Polyhedra.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	computational geometry, polyhedron, tetrahedralization
29	Ali Mohammad-Djafari, Yassine Khayi, Ken D. Sauer, Eric Cano	Reconstruction of the Shape of a Compact Object from Few Projections.	ICIP (1)	1997	DBLP DOI BibTeX RDF	compact object, limited tomographic projection data, NDT, air hole, homogeneous region, metal, industrial techniques, default region shape, tomographic reconstruction, global optimization method, pixel representation, 2D representation, contour modelling, local descent-based method, moment based method, Bayesian MAP estimation, localization, coordinates, simulated annealing, image reconstruction, detection, polygon, industrial applications, characterization, vertices, surface modelling, inclusion, polyhedron, shape reconstruction, computational cost, 3D representation, voxel representation, nondestructive testing
29	Ming-En Wang, Tony C. Woo, Lin-Lin Chen, Shuo-Yan Chou	Computing spanning line segments in three dimensions.	Vis. Comput.	1996	DBLP DOI BibTeX RDF	Spanning line segments, Plane polyhedron intersections, Skeletons
29	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
28		Polyhedron.	Encyclopedia of Database Systems	2009	DBLP DOI BibTeX RDF
28	Tetsuji Takahashi, Mineichi Kudo, Atsuyoshi Nakamura	Classifier Selection in a Family of Polyhedron Classifiers.	CIARP	2009	DBLP DOI BibTeX RDF
28	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
28	Yunzhi Xue, Chen Zhao	Automated Phase-Ordering of Loop Optimizations Based on Polyhedron Model.	HPCC	2008	DBLP DOI BibTeX RDF
28	Mark Korenblit, Efraim Shmerling	Algorithm and Software for Integration over a Convex Polyhedron.	ICMS	2006	DBLP DOI BibTeX RDF
28	Dieter Vandenbussche, George L. Nemhauser	The 2-Edge-Connected Subgraph Polyhedron.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	traveling salesman problem, network design, polyhedra, edge-connectivity
28	Jaeho Lee 0004, Joon Young Park, Deok-Soo Kim, Hyun-Chan Lee	Triangular Prism Generation Algorithm for Polyhedron Decomposition.	ICCSA (3)	2005	DBLP DOI BibTeX RDF
28	Maciej Frydler, Wojciech S. Mokrzycki	Scanning Faces Surroudings - New Concept in 3D Exact Multiviews of Nonconvex Polyhedron Generation.	CORES	2005	DBLP DOI BibTeX RDF
28	Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn	Point containment in the integer hull of a polyhedron.	SODA	2004	DBLP BibTeX RDF
28	Jaeho Lee 0004, Joon Young Park, Deok-Soo Kim, Hyun-Chan Lee	Polyhedron Splitting Algorithm for 3D Layer Generation.	ICCSA (2)	2004	DBLP DOI BibTeX RDF
28	Wenhao Lin, Binhai Zhu, Gwen A. Jacobs, Gary Orser	Cylindrical Approximation of a Neuron from Reconstructed Polyhedron.	ICCSA (3)	2004	DBLP DOI BibTeX RDF
28	Angel Corberán, Antonio Romero, José M. Sanchis	The mixed general routing polyhedron.	Math. Program.	2003	DBLP DOI BibTeX RDF
28	Roger Z. Ríos-Mercado, Jonathan F. Bard	The Flow Shop Scheduling Polyhedron with Setup Time.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	facet-defining inequalities, polyhedral combinatorics, setup times, flow shop scheduling, asymmetric traveling salesman problem, linear ordering problem
28	Mordecai J. Golin, Hyeon-Suk Na	The probabilistic complexity of the Voronoi diagram of points on a polyhedron.	SCG	2002	DBLP DOI BibTeX RDF
28	Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.	Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees.	Discret. Comput. Geom.	1997	DBLP DOI BibTeX RDF
28	Kasturi R. Varadarajan, Pankaj K. Agarwal	Approximating Shortest Paths on an Nonconvex Polyhedron.	FOCS	1997	DBLP DOI BibTeX RDF
28	Jindong Chen, Yijie Han	Shortest Paths on a Polyhedron.	SCG	1990	DBLP DOI BibTeX RDF
21	Herminia I. Calvete, Carmen Galé, Pedro M. Mateo	A genetic algorithm for solving linear fractional bilevel problems.	Ann. Oper. Res.	2009	DBLP DOI BibTeX RDF	Linear fractional, Genetic algorithm, Bilevel programming, Extreme point
21	Sanjiv Kapoor, Xiang-Yang Li 0001	Geodesic Spanners on Polyhedral Surfaces.	ISAAC	2009	DBLP DOI BibTeX RDF
21	Jean-Luc Mari	Surface Sketching with a Voxel-Based Skeleton.	DGCI	2009	DBLP DOI BibTeX RDF	automatic mesh generation, topological skeleton, geometrical modeling, sketch, voxel, Discrete geometry
21	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