Search results for "polyhedron"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Kokichi Sugihara	Interpretation of an axonometric projection of a polyhedron.	Comput. Graph.	1984	DBLP DOI BibTeX RDF
18	Seymour B. Elk	Derivation of the principle of smallest set of smallest rings from Euler's polyhedron equation and a simplified technique for finding this set.	J. Chem. Inf. Comput. Sci.	1984	DBLP DOI BibTeX RDF
18	Seiji Ishikawa	Reconstructing faces on a polyhedron from apparent gradients of edges.	Comput. Vis. Graph. Image Process.	1984	DBLP DOI BibTeX RDF
18	Jeff Lane, Bob Magedson, Mike Rarick	An efficient point in polyhedron algorithm.	Comput. Vis. Graph. Image Process.	1984	DBLP DOI BibTeX RDF
18	Bernard Chazelle	A Decision Procedure for Optimal Polyhedron Partitioning.	Inf. Process. Lett.	1983	DBLP DOI BibTeX RDF
18	Alexander Schrijver	Short proofs on the matching polyhedron.	J. Comb. Theory, Ser. B	1983	DBLP DOI BibTeX RDF
18	Dirk Hausman	Adjacent vertices on the b-matching polyhedron.	Discret. Math.	1981	DBLP DOI BibTeX RDF
18	A. M. Messner, G. Q. Taylor	Algorithm 550: Solid Polyhedron Measures [Z].	ACM Trans. Math. Softw.	1980	DBLP DOI BibTeX RDF
18	Gary J. Koehler, Surya Kumar	Technical Note - A Look at Finding Points of a Convex Polyhedron Using Relaxation and Subgradient Procedures.	Oper. Res.	1980	DBLP DOI BibTeX RDF
18	Anders Björner	The Minimum Number of Faces of a Simple Polyhedron.	Eur. J. Comb.	1980	DBLP DOI BibTeX RDF
18	Rick Giles, Dirk Hausmann	Characterizations of adjacency on the branching polyhedron.	Discret. Math.	1979	DBLP DOI BibTeX RDF
18	Manuel J. Carrillo	A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron.	Math. Program.	1977	DBLP DOI BibTeX RDF
18	Arthur Appel, Peter M. Will	Determining the Three-Dimensional Convex Hull of a Polyhedron.	IBM J. Res. Dev.	1976	DBLP DOI BibTeX RDF
18	W. Altherr	An algorithm for enumerating all vertices of a convex polyhedron.	Computing	1975	DBLP DOI BibTeX RDF
18	Bruce G. Baumgart	A polyhedron representation for computer vision.	AFIPS National Computer Conference	1975	DBLP DOI BibTeX RDF
10	Lian Liu, Raymond Chi-Wing Wong	Finding shortest path on land surface.	SIGMOD Conference	2011	DBLP DOI BibTeX RDF
10	Florent Cadoux	Computing deep facet-defining disjunctive cuts for mixed-integer programming.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C10
10	Sanjeeb Dash, Oktay Günlük, Andrea Lodi 0001	MIR closures of polyhedral sets.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematical Subject Classification (2000) 90C10, 90C57, 90C11
10	Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer	Clamshell Casting.	Algorithmica	2009	DBLP DOI BibTeX RDF
10	Gershon Elber, Thomas A. Grandine	An Efficient Solution to Systems of Multivariate Polynomial Using Expression Trees.	IEEE Trans. Vis. Comput. Graph.	2009	DBLP DOI BibTeX RDF
10	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
10	Jean-Sébastien Franco, Edmond Boyer	Efficient Polyhedral Modeling from Silhouettes.	IEEE Trans. Pattern Anal. Mach. Intell.	2009	DBLP DOI BibTeX RDF
10	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
10	Shi-Qing Xin, Guo-Jin Wang	Improving Chen and Han's algorithm on the discrete geodesic problem.	ACM Trans. Graph.	2009	DBLP DOI BibTeX RDF	computational geometry, shortest path problems, Design and analysis of algorithms
10	Seok-Hee Hong 0001, Hiroshi Nagamochi	Upward Star-Shaped Polyhedral Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF
10	Therese C. Biedl, Burkay Genç	Cauchy's Theorem for Orthogonal Polyhedra of Genus 0.	ESA	2009	DBLP DOI BibTeX RDF
10	Gunther Reißig	Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems.	HSCC	2009	DBLP DOI BibTeX RDF
10	András Sebö	Path Partitions, Cycle Covers and Integer Decomposition.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF
10	Gill Barequet, Amir Vaxman	Straight skeletons of three-dimensional polyhedra.	SCG	2009	DBLP DOI BibTeX RDF	medial axis, straight skeleton
10	Caroline Essert-Villard, Antonio Capobianco	HardBorders: a new haptic approach for selection tasks in 3D menus.	VRST	2009	DBLP DOI BibTeX RDF	virtual reality, haptic interfaces, 3D interaction, menus, computer-human interfaces, force feedback devices
10	Kailash Jha	Reconstruction of Branching Surface and Its Smoothness by Reversible Catmull-Clark Subdivision.	ICCS (2)	2009	DBLP DOI BibTeX RDF	branching surface, incompatible curves, reconstruction, Catmull-Clark subdivision
10	Xinyu Zhang 0002, Young J. Kim, Dinesh Manocha	Reliable sweeps.	Symposium on Solid and Physical Modeling	2009	DBLP DOI BibTeX RDF
10	Philip J. Charles, Jacob M. Howe, Andy King	Integer Polyhedra for Program Analysis.	AAIM	2009	DBLP DOI BibTeX RDF
10	Dima Grigoriev	Probabilistic Communication Complexity Over The Reals.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification, 68W40
10	Fabio Tardella	Existence and sum decomposition of vertex polyhedral convex envelopes.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	Multilinear functions, Edge-concavity, Global optimization, Convex analysis, Convex envelope
10	Pando G. Georgiev, Panos M. Pardalos, Altannar Chinchuluun	Localization of minimax points.	J. Glob. Optim.	2008	DBLP DOI BibTeX RDF	Gilbert-Pollak conjecture, g-Vertex, Spanning tree, Steiner tree, Minimax, Steiner ratio
10	Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi 0001	Projected Chvátal-Gomory cuts for mixed integer linear programs.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C10, 90C57, 90C11
10	Egon Balas, Anureet Saxena	Optimizing over the split closure.	Math. Program.	2008	DBLP DOI BibTeX RDF
10	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
10	Wojciech S. Mokrzycki, Andrzej Salamonczyk	Spiral Scanning of Faces to Obtain Complete 3 D View Representation of Monotonous Polyhedra.	Computer Recognition Systems 2	2008	DBLP DOI BibTeX RDF
10	Sofia Kyratzi, Nickolas S. Sapidis	An interactive sketching method for 3D object modeling.	DIMEA	2008	DBLP DOI BibTeX RDF	3D reconstruction, solid modeling, sketch-based interface
10	Eva Dyllong	Convex Polyhedral Enclosures of Interval-Based Hierarchical Object Representations.	Reliable Implementation of Real Number Algorithms	2008	DBLP DOI BibTeX RDF
10	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
10	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
10	Sriram Sankaranarayanan 0001, Thao Dang 0001, Franjo Ivancic	A Policy Iteration Technique for Time Elapse over Template Polyhedra.	HSCC	2008	DBLP DOI BibTeX RDF
10	Valentin E. Brimkov	Scaling of Plane Figures That Assures Faithful Digitization.	IWCIA	2008	DBLP DOI BibTeX RDF	lattice polygon, polyhedral reconstruction, NP-hard problem, digital geometry, scaling factor
10	Henrik Schulz 0001	Polyhedral Surface Approximation of Non-convex Voxel Sets through the Modification of Convex Hulls.	IWCIA	2008	DBLP DOI BibTeX RDF
10	Yuru Pei, Hongbin Zha, Zhongbiao Yuan	Facial feature estimation from the local structural diversity of skulls.	ICPR	2008	DBLP DOI BibTeX RDF
10	Alexander Grigoriev, Joyce van Loon, Marc Uetz	Algorithms for Optimal Price Regulations.	WINE	2008	DBLP DOI BibTeX RDF	Pricing problems, three-level program optimization, social welfare maximization, EU roaming regulation
10	Gershon Elber, Thomas A. Grandine	Efficient solution to systems of multivariate polynomials using expression trees.	Shape Modeling International	2008	DBLP DOI BibTeX RDF
10	Salvatore Ruggieri, Frédéric Mesnard	Typing Linear Constraints for Moding CLP() Programs.	SAS	2008	DBLP DOI BibTeX RDF	well-moding, constraint logic programming, definiteness, polyhedra, linear constraints
10	Kai Yang 0001, Yihong Wu 0001, Jianwei Huang, Xiaodong Wang 0001, Sergio Verdú	Distributed Robust Optimization for Communication Networks.	INFOCOM	2008	DBLP DOI BibTeX RDF
10	Junfeng Hu, Xianmin Zhang, Jinqing Zhan	Trajectory Planning of a Novel 2-DoF High-Speed Planar Parallel Manipulator.	ICIRA (1)	2008	DBLP DOI BibTeX RDF	time optimum, trajectory planning, high speed, parallel manipulator
10	Michela Farenzena, Andrea Fusiello	3D surface models by geometric constraints propagation.	CVPR	2008	DBLP DOI BibTeX RDF
10	Vikas Singh, Lopamudra Mukherjee, Jinhui Xu 0001, Kenneth R. Hoffmann, Petru M. Dinu, M. Podgorsak	Brachytherapy Seed Localization Using Geometric and Linear Programming Techniques.	IEEE Trans. Medical Imaging	2007	DBLP DOI BibTeX RDF
10	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
10	K. Subramani 0001	On a decision procedure for quantified linear programs.	Ann. Math. Artif. Intell.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68W05, 68Q17, 90C05, 68W40
10	Joseph O'Rourke	Computational geometry column 49.	SIGACT News	2007	DBLP DOI BibTeX RDF
10	Anders Nedergaard Jensen	A Non-Regular Grobner Fan.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
10	Svetlana Lazebnik, Yasutaka Furukawa, Jean Ponce	Projective Visual Hulls.	Int. J. Comput. Vis.	2007	DBLP DOI BibTeX RDF	projective differential geometry, oriented projective geometry, silhouette, projective reconstruction, visual hull, 3D photography, frontier point
10	Fajie Li, Reinhard Klette	Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems.	ICCTA	2007	DBLP DOI BibTeX RDF
10	Peam Pipattanasomporn, Pawin Vongmasa, Attawith Sudsang	Two-Finger Squeezing Caging of Polygonal and Polyhedral Object.	ICRA	2007	DBLP DOI BibTeX RDF
10	Nina Amenta, Dominique Attali, Olivier Devillers	Complexity of Delaunay triangulation for points on lower-dimensional polyhedra.	SODA	2007	DBLP BibTeX RDF
10	Tsau Young Lin	Granular Computing and Modeling the Human Thoughts in Web Documents.	IFSA (1)	2007	DBLP DOI BibTeX RDF	rough set, topology, granular computing, simplicial complex, neighborhood system
10	Gábor Rétvári, József Bíró, Tibor Cinkler	Routing-Independent Fairness in Capacitated Networks.	ICC	2007	DBLP DOI BibTeX RDF
10	Hyung Taek Ahn, Mikhail J. Shashkov	Geometric Algorithms for 3D Interface Reconstruction.	IMR	2007	DBLP DOI BibTeX RDF	Interface reconstruction, polyhedral mesh, volume of fluid, moment of fluid
10	Eduardo Camponogara, Agustinho Plucenio	Lift-gas allocation under precedence constraints: 1-configuration inequalities.	SMC	2007	DBLP DOI BibTeX RDF
10	Chen Tet-Khuan, Alias Abdul-Rahman, Sisi Zlatanova	3D Spatial Operations in Geo DBMS Environment for 3D GIS.	ICCSA (1)	2007	DBLP DOI BibTeX RDF	3D spatial operations, geo-DBMS, 3D GIS
10	Min Liu 0018, Karthik Ramani	Computing an exact spherical visibility map for meshed polyhedra.	Symposium on Solid and Physical Modeling	2007	DBLP DOI BibTeX RDF	facet visibility, spherical visibility map, vector visibility algorithm
10	Jérôme Leroux, Grégoire Sutre	Acceleration in Convex Data-Flow Analysis.	FSTTCS	2007	DBLP DOI BibTeX RDF
10	Sanjeeb Dash, Oktay Günlük	Valid inequalities based on simple mixed-integer sets.	Math. Program.	2006	DBLP DOI BibTeX RDF
10	Sergey Shebalov, Diego Klabjan	Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds.	Math. Program.	2006	DBLP DOI BibTeX RDF	Polyhedral theory, Mixed integer programming
10	Hisashi Shimodaira	A Shape-from-Shading Method of Polyhedral Objects Using Prior Information.	IEEE Trans. Pattern Anal. Mach. Intell.	2006	DBLP DOI BibTeX RDF	modeling and recovery of physical attributes, shape, shading, scene analysis, 3D/stereo scene analysis, Vision and scene understanding
10	Antoine Miné	The octagon abstract domain.	High. Order Symb. Comput.	2006	DBLP DOI BibTeX RDF	Numerical abstract domains, Relational numerical invariants, Static analysis, Abstract interpretation
10	Nikolai P. Osmolovskii, Helmut Maurer	Second Order Optimality Conditions for Controls with Continuous and Bang-Bang Components.	Systems, Control, Modeling and Optimization	2006	DBLP DOI BibTeX RDF	bang-bang control, Pontryagin minimum principle, second order necessary and sufficient conditions, critical cone, strengthened Legendre condition, quadratic form
10	Axel Simon, Andy King	Widening Polyhedra with Landmarks.	APLAS	2006	DBLP DOI BibTeX RDF
10	Li Han, Lee Rudolph, Jonathon Blumenthal, Ihar Valodzin	Stratified Deformation Space and Path Planning for a Planar Closed Chain with Revolute Joints.	WAFR	2006	DBLP DOI BibTeX RDF
10	Guillaume Lavoué, Florence Denis, Florent Dupont, Atilla Baskurt	A Watermarking Framework for Subdivision Surfaces.	MRCS	2006	DBLP DOI BibTeX RDF
10	David Coeurjolly, Florent Dupont, Laurent Jospin, Isabelle Sivignon	Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification.	DGCI	2006	DBLP DOI BibTeX RDF
10	Yuan-Yu Tsai, Chung-Ming Wang, Chung-Hsien Chang, Yu-Ming Cheng	Tunable Bounding Volumes for Monte Carlo Applications.	ICCSA (1)	2006	DBLP DOI BibTeX RDF
10	Ken-ichi Kawarabayashi, Bojan Mohar	Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs.	STOC	2006	DBLP DOI BibTeX RDF	Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring
10	Liyu Tang, Chongcheng Chen, Qinmin Wang, Jingjing Sun	Modeling of Pinus Massoniana Based Morphological Architecture.	ICAT Workshops	2006	DBLP DOI BibTeX RDF
10	Antoine Miné	Symbolic Methods to Enhance the Precision of Numerical Abstract Domains.	VMCAI	2006	DBLP DOI BibTeX RDF
10	Jiann-Yeou Rau, Liang-Chien Chen, Fuan Tsai, Kuo-Hsin Hsiao, Wei-Chen Hsu	LOD Generation for 3D Polyhedral Building Model.	PSIVT	2006	DBLP DOI BibTeX RDF	3D Building Model, Generalization, Levels-of-Detail
10	Mohamad Ivan Fanany, Itsuo Kumazawa	A Neural Network for Simultaneously Reconstructing Transparent and Opaque Surfaces.	ICIAR (2)	2006	DBLP DOI BibTeX RDF
10	Isroil A. Ikromov, Akhmadjon Soleev	Newton Polyhedra and an Oscillation Index of Oscillatory Integrals with Convex Phases.	CASC	2006	DBLP DOI BibTeX RDF
10	Irene A. Sharaya	On Unbounded Tolerable Solution Sets.	Reliab. Comput.	2005	DBLP DOI BibTeX RDF
10	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
10	Fabián A. Chudak, David P. Williamson	Improved approximation algorithms for capacitated facility location problems.	Math. Program.	2005	DBLP DOI BibTeX RDF
10	Antonio Frangioni, Andrea Lodi 0001, Giovanni Rinaldi	New approaches for optimizing over the semimetric polytope.	Math. Program.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) 20E28, 20G40, 20C20
10	Egon Schulte	Chiral Polyhedra in Ordinary Space, II.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
10	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
10	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
10	Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis	Not Every GTSP Facet Induces an STSP Facet.	IPCO	2005	DBLP DOI BibTeX RDF	Graphical Traveling Salesman Problem, Symmetric Traveling Salesman Problem, polyhedral computation, facets, polyhedral combinatorics
10	Guillaume Lavoué, Florent Dupont, Atilla Baskurt	Toward a Near Optimal Quad/Triangle Subdivision Surface Fitting.	3DIM	2005	DBLP DOI BibTeX RDF
10	Gabriella Sanniti di Baja, Ingela Nyström, Gunilla Borgefors	Discrete 3D Tools Applied to 2D Grey-Level Images.	ICIAP	2005	DBLP DOI BibTeX RDF
10	Takayuki Kanaya, Yuji Teshima, Ken-ichi Kobori, Koji Nishio	A topology-preserving polygonal simplification using vertex clustering.	GRAPHITE	2005	DBLP DOI BibTeX RDF	level of detail, polygon, simplification, topology-preserving, vertex-clustering
10	Avneesh Sud, Mark Foskey, Dinesh Manocha	Homotopy-preserving medial axis simplification.	Symposium on Solid and Physical Modeling	2005	DBLP DOI BibTeX RDF	separation angle, voronoi diagram, medial axis, simplification, homotopy
10	Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery	Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces.	Algorithmica	2004	DBLP DOI BibTeX RDF	Discrete volumes, Digital plane recognition, Polyhedrization, Surface
10	Volkan Isler, Sampath Kannan, Kostas Daniilidis, Pavel Valtr 0001	VC-Dimension of Exterior Visibility.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	sampling, visibility, VC-dimension, sensor placement