Search results for "polygon"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	Paul Fischer, Hans Ulrich Simon	Separation Problems and Circular Arc Systems.	WG	1990	DBLP DOI BibTeX RDF	separating polygons, separating planar subdivisions, circular arc systems, number of stages, computational geometry, visibility, transversals, intersection graphs, computational learning
22	Odile Marcotte, Subhash Suri	On Geometric Matching.	SCG	1989	DBLP DOI BibTeX RDF
22	Yan Ke	An Efficient Algorithm for Link-Distance Problems.	SCG	1989	DBLP DOI BibTeX RDF
22	Gert Vegter	Kink-Free Deformations of Polygons.	SCG	1989	DBLP DOI BibTeX RDF
22	Joseph S. B. Mitchell	On Maximum Flows in Polyhedral Domains.	SCG	1988	DBLP DOI BibTeX RDF
22	Leonidas J. Guibas, John Hershberger 0001, Daniel Leven, Micha Sharir, Robert Endre Tarjan	Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons.	SCG	1986	DBLP DOI BibTeX RDF
22	Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chen, Jiun-Jie Peng	Object coverage with camera rotation in visual sensor networks.	IWCMC	2010	DBLP DOI BibTeX RDF	angle of view, object coverage, visual sensor networks, cameras, convex polygon
22	Adrian Dumitrescu, Evan Hilscher	Convexification of polygons by length preserving transformations.	SCG	2010	DBLP DOI BibTeX RDF	edge-length preserving transformation, polygon convexification, discrete geometry
22	Xuehou Tan, Bo Jiang 0004	Searching a Polygonal Region by Two Guards.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	polygon search problem, two-guard problem, robotics, computational geometry, visibility
22	David P. Dailey, Deborah Whitfield	Constructing random polygons.	SIGITE Conference	2008	DBLP DOI BibTeX RDF	n-gon, algorithm, computational geometry, random, polygon
22	Hanwen Guo, Minyong Shi, Zhiguo Hong, Rui Yang, Li Zhang	Virtual Artistic Paper-Cut.	Edutainment	2008	DBLP DOI BibTeX RDF	Subdivision Curve, Paper-Cut, NPR, SVG, Contour Extraction, Polygon Clipping
22	Walter G. Kropatsch, Adrian Ion, Samuel Peltier	Computing the Eccentricity Transform of a Polygonal Shape.	CIARP	2007	DBLP DOI BibTeX RDF	eccentricity transform, polygon, distance transform
22	Siddharth Manay, David W. Paglieroni	Matching Flexible Polygons to Fields of Corners Extracted from Images.	ICIAR	2007	DBLP DOI BibTeX RDF	Corner Extraction, Polygon Extraction, Overhead Imagery
22	Liu Hu Yao, He Yuan Jun	NFP-based nesting algorithm for irregular shapes.	SAC	2006	DBLP DOI BibTeX RDF	no fit polygon, genetic algorithm, packing, nesting, cutting stock
22	Luiz Gonzaga da Silveira Jr., Soraia Raupp Musse	Real-time generation of populated virtual cities.	VRST	2006	DBLP DOI BibTeX RDF	polygon partitioning and real-time visualization, virtual life simulation, terrain modeling, crowd simulation, city modeling
22	Xiaopeng Zhang 0001, Frédéric Blaise, Marc Jaeger 0002	Multiresolution plant models with complex organs.	VRCIA	2006	DBLP DOI BibTeX RDF	plant visualization, polygon decimation, multiresolution, natural phenomena
22	A. Ardeshir Goshtasby	Plus curves and surfaces.	Vis. Comput.	2005	DBLP DOI BibTeX RDF	Bézier curve, Bézier surface, rational Gaussian (RaG) surface, geometric modeling, polygon mesh, B-spline curve
22	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
22	Jianbo Qian, Cao An Wang	A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons.	Algorithmica	2004	DBLP DOI BibTeX RDF	Maximum weight triangulation, Algorithm, Approximation scheme, Convex polygon
22	Akira Hiraki, Jack H. Koolen	A Note on Regular Near Polygons.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Regular near polygon, Distance-regular graph
22	Eric Tabellion, Arnauld Lamorlette	An approximate global illumination system for computer generated films.	ACM Trans. Graph.	2004	DBLP DOI BibTeX RDF	irradiance caching, micro-polygon, rendering, global illumination, distributed ray tracing
22	Weishi Li, Shuhong Xu, Gang Zhao, Conghua Wen	Feature-preserving smoothing algorithm for polygons and meshes.	VRCAI	2004	DBLP DOI BibTeX RDF	mesh, smoothing, polygon, feature-preserving
22	Pierre Alliez, David Cohen-Steiner, Olivier Devillers, Bruno Lévy 0001, Mathieu Desbrun	Anisotropic polygonal remeshing.	ACM Trans. Graph.	2003	DBLP DOI BibTeX RDF	anisotropic sampling, lines of curvatures, surface remeshing, approximation theory, polygon meshes, tensor fields
22	Bruno Lévy 0001	Dual domain extrapolation.	ACM Trans. Graph.	2003	DBLP DOI BibTeX RDF	minimal energy surfaces, natural boundaries, differential geometry, polygon meshes, shape optimization
22	Ryutarou Ohbuchi, Tsuyoshi Takei	Shape-Similarity Comparison of 3D Models Using Alpha Shapes.	PG	2003	DBLP DOI BibTeX RDF	content-based search and retrieval, 3D alpha shapes, polygon soup, geometric modeling
22	Anne Fredet	Factorization of linear differential operators in exponential extensions.	ISSAC	2003	DBLP DOI BibTeX RDF	Newton polygon and polynomials, linear differential operators factorization
22	David Cline, Parris K. Egbert	Terrain Decimation through Quadtree Morphing.	IEEE Trans. Vis. Comput. Graph.	2001	DBLP DOI BibTeX RDF	Polygon decimation, Geomorph, terrain rendering
22	Pei-Zhuang Wang, Ralf Östermark, Rajan Alex, Shaohua Tan	Polyhedral representation of fuzzy linear bases.	Soft Comput.	2001	DBLP DOI BibTeX RDF	Fuzzy linear bases, Fuzzy interpolation, Maximal profile, Polygon of fuzzy linear bases, Polyhedral representation, Nonlinear separable programming
22	Christian Icking, Rolf Klein, Elmar Langetepe	An Optimal Competitive Strategy for Walking in Streets.	STACS	1999	DBLP DOI BibTeX RDF	LR-visibility, on-line navigation, street, Computational geometry, path planning, polygon, autonomous robot, competitive strategy
22	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
22	Jairo Rocha, Rafael Bernardino	Singularities and Regularities on Line Pictures via Symmetrical Trapezoids.	ICDAR	1997	DBLP DOI BibTeX RDF	Singular-Regular Polygon Decomposition, Trapezoid Covering, Skeleton
22	Dina Kravets, C. Greg Plaxton	All Nearest Smaller Values on the Hypercube.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	All nearest smaller values, normal hypercube algorithm, monotone polygon triangulation, Cartesian tree
22	Youngkwan Cho, Ulrich Neumann, Jongwook Woo	Improved Specular Highlights With Adaptive Shading.	Computer Graphics International	1996	DBLP DOI BibTeX RDF	specular highlights, adaptive shading, Gouraud shading, Phong shading, interpolation methods, polygon mesh rendering, illumination equation, computational geometry, interpolation, rendering (computer graphics), surface geometry, curved surface
22	Yucel Altunbasak, A. Murat Tekalp, Gozde Bozdagi	Two-dimensional object-based coding using a content-based mesh and affine motion parameterization.	ICIP	1995	DBLP DOI BibTeX RDF	two dimensional object based coding, connectivity preserving schemes, affine motion parameterization, 2D object based video compression, 2D content based triangular mesh design, temporal mesh propagation, adaptive model failure detection, polygon based scheme, adaptive model failure coding, image segmentation, motion estimation, data compression, parameter estimation, video coding, motion compensation, motion compensation, experimental results, adaptive signal processing, bit rate control
22	Karsten Schröder, Roland Mech	Combined description of shape and motion in an object based coding scheme using curved triangles.	ICIP	1995	DBLP DOI BibTeX RDF	object based coding, curved triangles, object motion representation, object shape representation, video scene, object masks, regular triangles, grid points tracking, prediction images, deformed grid, reference frame warping, motion description, algorithm, grids, motion estimation, video coding, video coding, image representation, polygon, shape description, rendering (computer graphics), prediction theory, arcs, image rendering
22	Joseph F. JáJá, Kwan Woo Ryu	Optimal Algorithms on the Pipelined Hypercube and Related Networks.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	pipelined hypercube, monotone polygon, line packing, parallel algorithms, parallel algorithms, computational geometry, pipeline processing, combinatorial problems, combinatorial mathematics, cube-connected-cycles, shuffle-exchange
22	Van-Ban Le, D. T. Lee	Out-of-Roundness Problem Revisited.	IEEE Trans. Pattern Anal. Mach. Intell.	1991	DBLP DOI BibTeX RDF	minimum area difference centre, minimum radial separation, out-of-roundness, farthest-neighbor Voronoi diagram, computational geometry, computational geometry, polygon, medial axis, intersection points
22	Hiromitsu Yamada, Cathy Merritt, Tony Kasvand	Recognition of Kidney Glomerulus by Dynamic Programming Matching Method.	IEEE Trans. Pattern Anal. Mach. Intell.	1988	DBLP DOI BibTeX RDF	biomedical image analysis, kidney glomerulus, model segments, hierarchical multiresolution, kidney, dynamic programming, dynamic programming, edge detection, computerised pattern recognition, computerised pattern recognition, image matching, polygon, shape recognition, medical diagnostic computing, gray-level
20	Inyoung Shin, Ngoc Duy Pham, Hyunseung Choo	Virtual Convex Polygon Based Hole Boundary Detection and Time Delay Based Hole Detour Scheme in WSNs.	HCI (8)	2009	DBLP DOI BibTeX RDF	Hole Problem, Wireless Sensor Networks (WSNs), Geographic Routing
20	Xavier Provençal, Jacques-Olivier Lachaud	Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour.	DGCI	2009	DBLP DOI BibTeX RDF
20	Ramtin Khosravi, Mohammad Ghodsi	Visiting a Polygon on the Optimal Way to a Query Point.	FAW	2008	DBLP DOI BibTeX RDF
20	Shinichi Fukushige, Hiromasa Suzuki	Polygon visibility ordering via Voronoi diagrams.	Vis. Comput.	2007	DBLP DOI BibTeX RDF	Voronoi diagrams, Visibility determination, Visibility ordering, Space subdivision, Priority algorithm
20	Magdalene G. Borgelt, Marc J. van Kreveld, Jun Luo 0008	Geodesic Disks and Clustering in a Simple Polygon.	ISAAC	2007	DBLP DOI BibTeX RDF
20	Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Laumond	Swept Volume approximation of polygon soups.	ICRA	2007	DBLP DOI BibTeX RDF
20	Martin Pergel	Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete.	WG	2007	DBLP DOI BibTeX RDF
20	Asish Mukhopadhyay, Eugene Greene, S. V. Rao 0001	On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area.	ICCSA (1)	2007	DBLP DOI BibTeX RDF
20	Feiyu Lin, Kurt Sandkuhl	Polygon-Based Similarity Aggregation for Ontology Matching.	ISPA Workshops	2007	DBLP DOI BibTeX RDF
20	Xiaqing Wu, John K. Johnstone	Delaunay-Based Polygon Morphing Across a Change in Topology.	ICCSA (1)	2006	DBLP DOI BibTeX RDF
20	Shinichi Fukushige, Hiromasa Suzuki	Voronoi diagram depth sorting for polygon visibility ordering.	GRAPHITE	2006	DBLP DOI BibTeX RDF	depth sorting, transparency rendering, Voronoi diagram, visibility determination
20	Aimin Hao, Guifen Tian, Qinping Zhao, Zhide Li	An Accelerating Rendering Method of Hybrid Point and Polygon for Complex Three-Dimensional Models.	ICAT	2006	DBLP DOI BibTeX RDF	Modeling and rendering, Continuous multi-resolution models, Virtual reality, Point clouds, Real-time property
20	Baogang Bai, Zhongyue Li, Zhigeng Pan	Circular Arc Path Method: A New 2-D Polygon Blending Algorithm.	ICAT Workshops	2006	DBLP DOI BibTeX RDF	2-D shape blending, vertex interpolation path, vertex correspondence, NURBS
20	Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu	The Complexity of Diffuse Reflections in a Simple Polygon.	LATIN	2006	DBLP DOI BibTeX RDF
20	Eric Rémila	Tiling a Polygon with Two Kinds of Rectangles.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
20	Soji Yamakawa, Kenji Shimada	Polygon Crawling: Feature-Edge Extraction from a General Polygonal Surface for Mesh Generation.	IMR	2005	DBLP DOI BibTeX RDF
20	Leonardo Guerreiro Azevedo, Geraldo Zimbrão, Jano Moreira de Souza, Ralf Hartmut Güting	Estimating the Overlapping Area of Polygon Join.	SSTD	2005	DBLP DOI BibTeX RDF
20	José Cano 0001	The Newton Polygon Method for Differential Equations.	IWMM/GIAE	2004	DBLP DOI BibTeX RDF
20	Eric Rémila	Tiling a Polygon with Two Kinds of Rectangles.	ESA	2004	DBLP DOI BibTeX RDF
20	Khanh P. V. Doan	Antialiased Rendering of Self-Intersecting Polygons using Polygon Decomposition.	PG	2004	DBLP DOI BibTeX RDF
20	Atsuyuki Okabe, Tohru Yoshikawa	SAINF: A toolbox for analyzing the effect of point-like, line-like and polygon-like infrastructural features on the distribution of point-like non-infrastructural features.	J. Geogr. Syst.	2003	DBLP DOI BibTeX RDF	nearest neighbor distance method, K-function method, tools, infrastructure
20	Mireille Boutin	Polygon Recognition and Symmetry Detection.	Found. Comput. Math.	2003	DBLP DOI BibTeX RDF
20	Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen	On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts.	ISAAC	2003	DBLP DOI BibTeX RDF
20	Mirela Tanase, Remco C. Veltkamp	Polygon decomposition based on the straight line skeleton.	SCG	2003	DBLP DOI BibTeX RDF	straight line skeleton, polygonal decomposition
20	Ross Brown 0001, Luke Cooper, Binh Pham 0001	Visual attention-based polygon level of detail management.	GRAPHITE	2003	DBLP DOI BibTeX RDF	level of detail management, visual attention, real-time graphics
20	Jerome L. Lewis	A reliable test for inclusion of a point in a polygon.	ACM SIGCSE Bull.	2002	DBLP DOI BibTeX RDF
20	Andrzej Trembilski, Andreas Broßler	Transparency for polygon based cloud rendering.	SAC	2002	DBLP DOI BibTeX RDF	cloud modelling and visualisation, meteorological visualisation, transparency computation
20	Jin Akiyama, Gisaku Nakamura	Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon.	JCDCG	2002	DBLP DOI BibTeX RDF
20	Jairo Rocha	Polygon Partition into Stable Regions.	DAGM-Symposium	2002	DBLP DOI BibTeX RDF
20	Raed Abu Zitar, Ahmad M. Al-Fahed Nuseirat	A Theoretical Approach of an Intelligent Robot Gripper to Grasp Polygon Shaped Objects.	J. Intell. Robotic Syst.	2001	DBLP DOI BibTeX RDF	grasping forces, genetic algorithm, optimization, rule-base, classifier system, reinforcement, grasp planning
20	Uwe Rauschenbach, René Rosenbaum, Heidrun Schumann	A flexible polygon representation of multiple overlapping regions of interest for wavelet-based image coding.	ICIP (3)	2001	DBLP DOI BibTeX RDF
20	Martin Isenburg, Jack Snoeyink	Compressing the Property Mapping of Polygon Meshes.	PG	2001	DBLP DOI BibTeX RDF
20	Sara McMains, Joseph M. Hellerstein, Carlo H. Séquin	Out-of-core build of a topological data structure from polygon soup.	Symposium on Solid Modeling and Applications	2001	DBLP DOI BibTeX RDF
20	Yuzo Ohta	Nonconvex Polygon Interval Arithmetic as a Tool for the Analysis and Design of Robust Control Systems.	Reliab. Comput.	2000	DBLP DOI BibTeX RDF
20	Yuan-Chung Lee, Chein-Wei Jen	On-Line Polygon Refining Using a Low Computation Subdivision Algorithm.	GMP	2000	DBLP DOI BibTeX RDF
20	Sung Kwon Kim, Chan-Su Shin	Efficient Algorithms for Two-Center Problems for a Convex Polygon.	COCOON	2000	DBLP DOI BibTeX RDF
20	Francis Y. L. Chin, Jack Snoeyink, Cao An Wang	Finding the Medial Axis of a Simple Polygon in Linear Time.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
20	Francisco J. Coslado, Pelegrín Camacho, Martin González, Fabián Arrebola, Francisco Sandoval Hernández	VLSI Implementation of a Foveal Polygon Segmentation Algorithm.	ICIAP	1999	DBLP DOI BibTeX RDF
20	Andrzej Lingas, Valeriu Soltan	Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions.	Theory Comput. Syst.	1998	DBLP DOI BibTeX RDF
20	Andrzej Lingas, Valeriu Soltan	Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions.	ISAAC	1996	DBLP DOI BibTeX RDF
20	Prosenjit Bose, Godfried T. Toussaint	Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application.	Computer Graphics International	1996	DBLP DOI BibTeX RDF
20	Francis Y. L. Chin, Jack Snoeyink, Cao An Wang	Finding the Medial Axis of a Simple Polygon in Linear Time.	ISAAC	1995	DBLP DOI BibTeX RDF
20	Cao An Wang, Francis Y. L. Chin	Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract).	ESA	1995	DBLP DOI BibTeX RDF
20	Gautam Das 0001, Giri Narasimhan	Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon.	SCG	1994	DBLP DOI BibTeX RDF
20	Sven Schuierer	An O(log N) Algorithm to Compute the Kernel of a Polygon.	SWAT	1994	DBLP DOI BibTeX RDF
20	Raghu Sastry, N. Ranganathan, Horst Bunke	VLSI architectures for polygon recognition.	IEEE Trans. Very Large Scale Integr. Syst.	1993	DBLP DOI BibTeX RDF
20	Danny Z. Chen	Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon.	ISAAC	1993	DBLP DOI BibTeX RDF
20	Sven Schuierer	Rectilinear Path Queries in a Simple Rectilinear Polygon.	STACS	1993	DBLP DOI BibTeX RDF
20	Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri	Optimal Link Path Queries in a Simple Polygon.	SODA	1992	DBLP BibTeX RDF
20	Danny Z. Chen	An Optimal Parallel Algorithm for Detecting Weak Visibility of a Simple Polygon.	SCG	1992	DBLP DOI BibTeX RDF
20	Rolf Klein, Andrzej Lingas	Manhattonian Proximity in a Simple Polygon.	SCG	1992	DBLP DOI BibTeX RDF
20	Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri	On the Optimal Bisection of a Polygon (Extended Abstract).	SCG	1990	DBLP DOI BibTeX RDF
20	Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint	Determining Sector Visibility of a Polygon.	SCG	1989	DBLP DOI BibTeX RDF
20	L. Paul Chew, Klara Kedem	Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles.	SCG	1989	DBLP DOI BibTeX RDF
20	Joseph Friedman, John Hershberger 0001, Jack Snoeyink	Compliant Motion in a Simple Polygon.	SCG	1989	DBLP DOI BibTeX RDF
20	Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack	An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon.	STACS	1989	DBLP DOI BibTeX RDF
20	Costas S. Iliopoulos, William F. Smyth	PRAM Algorithms for Identifying Polygon Similarity.	Optimal Algorithms	1989	DBLP DOI BibTeX RDF
20	Surendra Nahar, Sartaj K. Sahni	Fast algorithm for polygon decomposition.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1988	DBLP DOI BibTeX RDF
20	Subir Kumar Ghosh	Computing a Viewpoint of a Set of Points Inside a Polygon.	FSTTCS	1988	DBLP DOI BibTeX RDF
20	William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap	Computing the Link Center of a Simple Polygon.	SCG	1987	DBLP DOI BibTeX RDF
20	Robert A. Reckhow, Joseph C. Culberson	Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons.	SCG	1987	DBLP DOI BibTeX RDF
20	J. Mark Keil	Minimally Covering a Horizontally Convex Orthogonal Polygon.	SCG	1986	DBLP DOI BibTeX RDF