Search results for "Int. J. Comput. Geometry Appl."

Hits ?▲	Authors	Title	Venue	Year	Link
1	Md. Ashraful Alam, Masud Hasan	Computing Nice Projections of Convex Polyhedra.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz	Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Mustaq Ahmed, Anna Lubiw	Shortest Descending Paths: towards an Exact Algorithm.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera	Fpt-Algorithms for Minimum-Bends Tours.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron	The Aligned k-Center Problem.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Matthew J. Katz, Gila Morgenstern	Guarding Orthogonal Art Galleries with Sliding Cameras.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Thiago R. dos Santos, Hans-Peter Meinzer, Lena Maier-Hein	Extending the Doubly Linked Face List for the Representation of 2-pseudomanifolds and 2-Manifolds with Boundaries.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	John H. Reif, Sam Slee	Asymptotically Optimal Kinodynamic Motion Planning for a Class of Modular Self-Reconfigurable Robots.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Maarten Löffler	Existence and Computation of Tours through Imprecise Points.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Therese C. Biedl, Burkay Genç	Stoker's Theorem for Orthogonal Polyhedra.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Ludmila Scharf, Marc Scherfenberg	Inducing Polygons of Line Arrangements.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Guilherme Dias da Fonseca	Fitting Flats to Points with Outliers.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo	A Complete Algorithm for Searchlight Scheduling.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Serge Gosselin, Carl Ollivier-Gooch	Constructing Constrained Delaunay Tetrahedralizations of Volumes Bounded by Piecewise Smooth Surfaces.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi	An Approximation Algorithm for Locating Maximal Disks within Convex Polygons.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Wael El Oraiby, Dominique Schmitt, Jean-Claude Spehner	Centroid Triangulations from k-Sets.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Prosenjit Bose, Mercè Mora, Carlos Seara, Saurabh Sethia	On Computing Enclosing Isosceles Triangles and Related Problems.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	A. M. Berkoff, James M. Henle, A. E. McDonough, A. P. Wesolowski	Possibilities and Impossibilities in Square-Tiling.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Christian Knauer, Marc Scherfenberg	Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Seok-Hee Hong, Hiroshi Nagamochi	Guest Editors' Foreword.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Luca Castelli Aleardi, Olivier Devillers, Abdelkrim Mebarki	Catalog-Based Representation of 2D Triangulations.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Sang-Sub Kim, Sang Won Bae, Hee-Kap Ahn	Covering a Point Set by Two Disjoint Rectangles.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Zeyu Guo, He Sun, Hong Zhu	Greedy Construction of 2-Approximate Minimum Manhattan Networks.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Ewa Misiolek	Free-Form Surface Partition in 3-d.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Khaled M. Elbassioni, Amr Elmasry, Kazuhisa Makino	Finding Simplices containing the Origin in Two and Three Dimensions.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Rabl, Zbynek Sír	Computational and Structural Advantages of Circular Boundary Representation.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint	Computing Signed Permutations of Polygons.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Alexander Rand, Noel Walkington	Delaunay Refinement Algorithms for Estimating Local Feature Size in 2D and 3D.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Chansophea Chuon, Sumanta Guha, Paul Janecek, Nguyen Duc Cong Song	Simplipoly: Curvature-Based Polygonal Curve Simplification.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Guillaume Batog, Xavier Goaoc	Inflating Balls is NP-Hard.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo	Detecting Commuting Patterns by Clustering Subtrajectories.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern	Multi Cover of a Polygon Minimizing the Sum of Areas.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Magdalene G. Borgelt, Marc J. van Kreveld, Jun Luo	Geodesic Disks and Clustering in a Simple Polygon.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao	Minkowski Sum Selection and Finding.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Otfried Cheong, Antoine Vigneron, Juyoung Yon	Reverse Nearest Neighbor Queries in Fixed Dimension.	Int. J. Comput. Geometry Appl.	2011	DBLP DOI BibTeX RDF
1	Ranjith Unnikrishnan, Jean-François Lalonde, Nicolas Vandapel, Martial Hebert	Scale Selection for Geometric Fitting in Noisy Point Clouds.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Jinhui Xu, Yang Yang, Yongding Zhu, Naoki Katoh	A Geometric Spanner of Segments.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx	Computing Geometric Minimum-Dilation Graphs is NP-Hard.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Bill Jackson, Tibor Jordán	Operations Preserving Global Rigidity of Generic Direction-Length Frameworks.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Erik D. Demaine, John Iacono, Stefan Langerman	Grid Vertex-Unfolding Orthostacks.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Tom Kamphans, Elmar Langetepe	Leaving an Unknown Maze Using an Error-Prone Compass.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Eric Y. Chen	Geometric Streaming Algorithm with a Sorting Primitive.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Frédéric Chazal, André Lieutier, Jarek Rossignac, Brian Whited	Ball-Map: Homeomorphism between Compatible Surfaces.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Pankaj Kumar, Piyush Kumar	Almost Optimal Solutions to k-Clustering Problems.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Andrzej Zak	Dissections of Polygons into Convex Polygons.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Rodrigo I. Silveira, René van Oostrum	Flooding Countries and Destroying dams.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Joshua Brown Kramer, Lucas Sabalka	Multidimensional Online Motion Planning for a Spherical Robot.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Ewa Misiolek	Finding Many Optimal Paths without Growing any Optimal Path Trees.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Yoav Gabriely, Elon Rimon	Competitive Complexity of Mobile Robot on-Line Motion Planning Problems.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Peter Brass, Hyeon-Suk Na, Chan-Su Shin	Guarding a Polygon from Two Nearly-Opposite Directions.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Yoav Amit, Joseph S. B. Mitchell, Eli Packer	Locating Guards for Visibility Coverage of Polygons.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Sergey Bereg, Adrian Dumitrescu, Minghui Jiang	Maximum Area Independent Sets in Disk Intersection Graphs.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang	Dilation-Optimal Edge Deletion in Polygonal Cycles.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu	Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès	Pareto Envelopes in Simple Polygons.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Andrea Anghinolfi, Luca Costa, Massimo Ferri, Enrico Viarani	A Covering Projection for Robot Navigation under Strong anisotropy.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle	Finding Popular Places.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Meera Sitharam, Yong Zhou, Jörg Peters	Reconciling Conflicting Combinatorial Preprocessors for Geometric Constraint Systems.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	John C. Owen, Steve C. Power	Frameworks Symmetry and Rigidity.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Victor Milenkovic, Elisha Sacks	Two Approximate Minkowski Sum Algorithms.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Tsunehiko Kameda, John Z. Zhang	Finding All Door Locations that Make a Room Searchable.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta	Generalized Watchman Route Problem with Discrete View Cost.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Chris Gray, Maarten Löffler, Rodrigo I. Silveira	Smoothing Imprecise 1.5D Terrains.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw	A Lower Bound on the Area of a 3-Coloured Disk Packing.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Mikio Kano, Miyuki Uno	Balanced Subdivisions with Boundary Condition of Two Sets of Points in the Plane.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Takeshi Tokuyama	Foreword.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath	Constrained Point-Set Embeddability of Planar Graphs.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Boris Aronov, Tetsuo Asano, Stefan Funke	Optimal Triangulations of Points and Segments with Steiner Points.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Sanjiv Kapoor, Xiang-Yang Li	Proximity Structures for Geometric Graphs.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Mark de Berg, Elena Mumford, Bettina Speckmann	Optimal BSPs and Rectilinear Cartograms.	Int. J. Comput. Geometry Appl.	2010	DBLP DOI BibTeX RDF
1	Prosenjit Bose, Michiel H. M. Smid, Daming Xu	Delaunay and diamond Triangulations contain Spanners of Bounded Degree.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Frank Nielsen, Richard Nock	Approximating Smallest Enclosing Balls with Applications to Machine Learning.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp	Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop	Pricing Geometric Transportation Networks.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Manuel Abellanas, Prosenjit Bose, Jesús García, Ferran Hurtado, Carlos M. Nicolás, Pedro Ramos	On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Tetsuo Asano	Guest Editor's Foreword.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Dominique Faudot, Lionel Garnier	Initial Parametric Representation of Blobs.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Gadi Aleksandrowicz, Gill Barequet	Counting d-Dimensional Polycubes and nonrectangular Planar polyominoes.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Sheung-Hung Poon	On Unfolding Lattice Polygons/Trees and Diameter-4 Trees.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Deok-Soo Kim	Guest Editor's Foreword.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Sang Won Bae, Jae-Hoon Kim, Kyung-Yong Chwa	Optimal Construction of the City Voronoi Diagram.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum, Alexander Wolff	A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters	Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Xiaodong Wu	Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Yusu Wang	Relations between Two Common Types of Rectangular Tilings.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Xiaodong Wu, Xin Dou, John E. Bayouth, John M. Buatti	Efficient Algorithm for Optimal Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Marina L. Gavrilova	An Explicit Solution for Computing the vertices of the Euclidean d-Dimensional Voronoi Diagram of Spheres in a Floating-Point Arithmetic.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Scott E. Dillard, Vijay Natarajan, Gunther H. Weber, Valerio Pascucci, Bernd Hamann	Topology-Guided Tessellation of Quadratic Elements.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Tetsushi Nishida, Kokichi Sugihara	Boat-Sail Voronoi Diagram and its Application.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Borislav H. Simov, Giora Slutzki, Steven M. LaValle	Clearing a Polygon with Two 1-Searchers.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Asish Mukhopadhyay, Eugene Greene, S. V. Rao	On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Danny Z. Chen, D. T. Lee	Editors' Foreword.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Yakov Nekrich	A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Stefan Porschen	On Rectangular Covering Problems.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Christopher J. Sangwin	Deceiving the V-Block Method for Assessment of Departure from Roundness.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Yefim Dinitz, Matthew J. Katz, Roi Krakovski	Guarding Rectangular Partitions.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid	Efficient Non-Intersection Queries on Aggregated Geometric Data.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Henk Bekker, Axel Brink, Jos B. T. M. Roerdink	Reducing the Time Complexity and Identifying Ill-posed Problem Instances of Minkowski Sum Based Similarity calculations.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Jon G. Rokne	Guest Editor's Foreword.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF
1	Ovidiu Daescu, James D. Palmer	Minimum Separation in Weighted Subdivisions.	Int. J. Comput. Geometry Appl.	2009	DBLP DOI BibTeX RDF

Publications at "Int. J. Comput. Geometry Appl."( http://dblp.L3S.de/Venues/Int._J._Comput._Geometry_Appl. )