Prosenjit Bose

According to our database1, Prosenjit Bose authored at least 296 papers between 1993 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
(Faster) Multi-Sided Boundary Labelling.
CoRR, 2020

Drawing Graphs as Spanners.
CoRR, 2020

Self-approaching paths in simple polygons.
Comput. Geom., 2020

Hamiltonicity for convex shape Delaunay and Gabriel graphs.
Comput. Geom., 2020

Optimal Art Gallery Localization is NP-hard.
Comput. Geom., 2020

Parameterized Complexity of Two-Interval Pattern Problem.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Bounded-Angle Minimum Spanning Trees.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Competitive Online Search Trees on Trees.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
A time-space trade-off for computing the k-visibility region of a point in a polygon.
Theor. Comput. Sci., 2019

Pole Dancing: 3D Morphs for Tree Drawings.
J. Graph Algorithms Appl., 2019

Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints.
Int. J. Comput. Geom. Appl., 2019

Improved Bounds for Guarding Plane Graphs with Edges.
Graphs Comb., 2019

Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs.
CoRR, 2019

On Plane Constrained Bounded-Degree Spanners.
Algorithmica, 2019

Maximum Plane Trees in Multipartite Geometric Graphs.
Algorithmica, 2019

Computing Maximum Independent Set on Outerstring Graphs and Their Relatives.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On the Spanning and Routing Ratio of Theta-Four.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Computing the k-Crossing Visibility Region of a Point in a Polygon.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Reconstructing a Convex Polygon from Its \omega ω -cloud.
Proceedings of the Computer Science - Theory and Applications, 2019

Attraction-convexity and Normal Visibility.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

Ane invariant triangulations.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

Three-Coloring Three-Dimensional Uniform Hypergraphs.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

Watchtower for k-crossing Visibility.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Routing on the visibility graph.
JoCG, 2018

Plane Bichromatic Trees of Low Degree.
Discret. Comput. Geom., 2018

Near-Optimal O(k)-Robust Geometric Spanners.
CoRR, 2018

Reconstructing a convex polygon from its ω-cloud.
CoRR, 2018

Editorial: Special issue in memory of Dr. Ferran Hurtado.
Comput. Geom., 2018

Flipping edge-labelled triangulations.
Comput. Geom., 2018

Constrained generalized Delaunay graphs are plane spanners.
Comput. Geom., 2018

Continuous Yao graphs.
Comput. Geom., 2018

Improved Spanning Ratio for Low Degree Plane Spanners.
Algorithmica, 2018

Spanning Trees in Multipartite Geometric Graphs.
Algorithmica, 2018

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
Algorithmica, 2018

Gathering by Repulsion.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Boundary Labeling for Rectangular Diagrams.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Geodesic Obstacle Representation of Graphs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Improved Routing on the Delaunay Triangulation.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Faster Algorithms for some Optimization Problems on Collinear Points.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
A general framework for searching on a line.
Theor. Comput. Sci., 2017

Competitive local routing with constraints.
JoCG, 2017

Towards plane spanners of degree 3.
JoCG, 2017

Essential Constraints of Edge-Constrained Proximity Graphs.
J. Graph Algorithms Appl., 2017

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem.
J. Graph Algorithms Appl., 2017

Competitive Online Routing on Delaunay Triangulations.
Int. J. Comput. Geom. Appl., 2017

New Bounds for Facial Nonrepetitive Colouring.
Graphs Comb., 2017

Upper and Lower Bounds for Online Routing on Delaunay Triangulations.
Discret. Comput. Geom., 2017

Art Gallery Localization.
CoRR, 2017

Flips in edge-labelled pseudo-triangulations.
Comput. Geom., 2017

Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Local Routing in Spanners Based on WSPDs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Constrained Routing Between Non-Visible Vertices.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Power Domination on Triangular Grids.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

On the separation of a polyhedron from its single-part mold.
Proceedings of the 13th IEEE Conference on Automation Science and Engineering, 2017

2016
Towards tight bounds on theta-graphs: More is not always better.
Theor. Comput. Sci., 2016

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere.
JoCG, 2016

A plane 1.88-spanner for points in convex position.
JoCG, 2016

The Price of Order.
Int. J. Comput. Geom. Appl., 2016

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.
Discret. Comput. Geom., 2016

Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon.
CoRR, 2016

Probing convex polygons with a wedge.
Comput. Geom., 2016

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon.
Comput. Geom., 2016

Biased Predecessor Search.
Algorithmica, 2016

The Power and Limitations of Static Binary Search Trees with Lazy Finger.
Algorithmica, 2016

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.
Proceedings of the Graph Drawing and Network Visualization, 2016

A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Searching on a line: A complete characterization of the optimal solution.
Theor. Comput. Sci., 2015

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles.
SIAM J. Comput., 2015

New and improved spanning ratios for Yao graphs.
JoCG, 2015

Optimal Data Structures for Farthest-Point Queries in Cactus Networks.
J. Graph Algorithms Appl., 2015

Packing Plane Perfect Matchings into a Point Set.
Discret. Math. Theor. Comput. Sci., 2015

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations.
CoRR, 2015

The θ5-graph is a spanner.
Comput. Geom., 2015

Reprint of: Theta-3 is connected.
Comput. Geom., 2015

Visibility-monotonic polygon deflation.
Contributions Discret. Math., 2015

Local Routing in Convex Subdivisions.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

The Shadows of a Cycle Cannot All Be Paths.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Constrained Empty-Rectangle Delaunay Graphs.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

One of Ferran Hurtado's favorite topics - Flips.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Surface roughness of rock faces through the curvature of triangulated meshes.
Comput. Geosci., 2014

Towards Tight Bounds on Theta-Graphs.
CoRR, 2014

Towards a General Framework for Searching on a Line and Searching on $m$ Rays.
CoRR, 2014

Making triangulations 4-connected using flips.
Comput. Geom., 2014

Minimum-area enclosing triangle with a fixed angle.
Comput. Geom., 2014

Triangulating and guarding realistic polygons.
Comput. Geom., 2014

Theta-3 is connected.
Comput. Geom., 2014

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.
Algorithmica, 2014

Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Optimal Algorithms for Constrained 1-Center Problems.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Convex Hull of Points on a Sphere is a Spanner.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Searching by Panning and Zooming.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Continuous Yao Graphs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

A General Framework to Generate Sizing Systems from 3D Motion Data Applied to Face Mask Design.
Proceedings of the 2nd International Conference on 3D Vision, 2014

2013
Robust Geometric Spanners.
SIAM J. Comput., 2013

Network Farthest-Point Diagrams.
JoCG, 2013

Coverage with k-transmitters in the presence of obstacles.
J. Comb. Optim., 2013

Coloring and Guarding Arrangements.
Discret. Math. Theor. Comput. Sci., 2013

Bounding the locality of distributed routing algorithms.
Distributed Comput., 2013

New and Improved Spanning Ratios for Yao Graphs.
CoRR, 2013

On plane geometric spanners: A survey and open problems.
Comput. Geom., 2013

Fast local searches and updates in bounded universes.
Comput. Geom., 2013

Some properties of k-Delaunay and k-Gabriel graphs.
Comput. Geom., 2013

Stable Roommates Spanner.
Comput. Geom., 2013

The θ 5-Graph is a Spanner.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On the Spanning Ratio of Theta-Graphs.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On the Stretch Factor of the Theta-4 Graph.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Revisiting the Problem of Searching on a Line.
Proceedings of the Algorithms - ESA 2013, 2013

Computing Covers of Plane Forests.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

A History of Distribution-Sensitive Data Structures.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Succinct geometric indexes supporting point location queries.
ACM Trans. Algorithms, 2012

A distribution-sensitive dictionary with low space overhead.
J. Discrete Algorithms, 2012

Skip lift: A probabilistic alternative to red-black trees.
J. Discrete Algorithms, 2012

On bounded degree plane strong geometric spanners.
J. Discrete Algorithms, 2012

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.
Int. J. Comput. Geom. Appl., 2012

π/2-Angle Yao Graphs are Spanners.
Int. J. Comput. Geom. Appl., 2012

The theta-5-graph is a spanner
CoRR, 2012

Editorial.
Comput. Geom., 2012

Layered Working-Set Trees.
Algorithmica, 2012

Competitive routing in the half-θ6-graph.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

On Spanning Properties of Various Delaunay Graphs.
Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

De-amortizing Binary Search Trees.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Flips.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Competitive Routing on a Bounded-Degree Plane Spanner.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Optimal Bounds on Theta-Graphs: More is not Always Better.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

On Farthest-Point Information in Networks.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Spanners of additively weighted point sets.
J. Discrete Algorithms, 2011

On Computing Enclosing Isosceles Triangles and Related Problems.
Int. J. Comput. Geom. Appl., 2011

Computing Signed Permutations of Polygons.
Int. J. Comput. Geom. Appl., 2011

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
Graphs Comb., 2011

Automatically Creating Design Models from 3D Anthropometry Data
CoRR, 2011

A survey of geodesic paths on 3D surfaces.
Comput. Geom., 2011

Almost all Delaunay triangulations have stretch factor greater than pi/2.
Comput. Geom., 2011

A note on the perimeter of fat objects.
Comput. Geom., 2011

On a family of strong geometric spanners that admit local routing strategies.
Comput. Geom., 2011

Location-Oblivious Distributed Unit Disk Graph Coloring.
Algorithmica, 2011

A History of Flips in Combinatorial Triangulations.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Isoperimetric Triangular Enclosure with a Fixed Angle.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
On the Stretch Factor of Convex Delaunay Graphs.
JoCG, 2010

Sigma-local graphs.
J. Discrete Algorithms, 2010

Morphing of Triangular Meshes in Shape Space.
Int. J. Shape Model., 2010

Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding.
Int. J. Shape Model., 2010

The dilation of the Delaunay triangulation is greater than π/2
CoRR, 2010

An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
CoRR, 2010

Odds-On Trees
CoRR, 2010

Pi/2-Angle Yao Graphs are Spanners
CoRR, 2010

Point Location in Disconnected Planar Subdivisions
CoRR, 2010

Computing the Greedy Spanner in Near-Quadratic Time.
Algorithmica, 2010

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.
Proceedings of the Algorithm Theory, 2010

Improved Methods For Generating Quasi-gray Codes.
Proceedings of the Algorithm Theory, 2010

Communication-Efficient Construction of the Plane Localized Delaunay Graph.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

pi/2-Angle Yao Graphs Are Spanners.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Should Static Search Trees Ever Be Unbalanced?
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Global Context Descriptors for SURF and MSER Feature Descriptors.
Proceedings of the Canadian Conference on Computer and Robot Vision, 2010

Coverage with k-Transmitters in the Presence of Obstacles.
Proceedings of the Combinatorial Optimization and Applications, 2010

Common Unfoldings of Polyominoes and Polycubes.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

Some properties of higher order delaunay and gabriel graphs.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

On the perimeter of fat objects.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Minimum enclosing area triangle with a fixed angle.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Spanners of Complete k-Partite Geometric Graphs.
SIAM J. Comput., 2009

Augmented reality on cloth with realistic illumination.
Mach. Vis. Appl., 2009

Algorithms for optimal outlier removal.
J. Discrete Algorithms, 2009

A note on the lower bound of edge guards of polyhedral terrains.
Int. J. Comput. Math., 2009

Delaunay and diamond Triangulations contain Spanners of Bounded Degree.
Int. J. Comput. Geom. Appl., 2009

On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs.
Int. J. Comput. Geom. Appl., 2009

Traversing a Set of Points with a Minimum Number of Turns.
Discret. Comput. Geom., 2009

Connectivity-preserving transformations of binary images.
Comput. Vis. Image Underst., 2009

Rotationally monotone polygons.
Comput. Geom., 2009

Editorial CCCG 2005.
Comput. Geom., 2009

Flips in planar graphs.
Comput. Geom., 2009

Geometric spanners with small chromatic number.
Comput. Geom., 2009

A linear-space algorithm for distance preserving graph embedding.
Comput. Geom., 2009

Clamshell Casting.
Algorithmica, 2009

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Efficient Construction of Near-Optimal Binary and Multiway Search Trees.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Filling holes in triangular meshes by curve unfolding.
Proceedings of the IEEE International Conference on Shape Modeling and Applications, 2009

Posture invariant correspondence of triangular meshes in shape space.
Proceedings of the 12th IEEE International Conference on Computer Vision Workshops, 2009

The spanning ratio of the Delaunay triangulation is greater than pi/2.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Relaxed Gabriel Graphs.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Coarse grained parallel algorithms for graph matching.
Parallel Comput., 2008

A Characterization of the degree sequences of 2-trees.
Journal of Graph Theory, 2008

On the false-positive rate of Bloom filters.
Inf. Process. Lett., 2008

A Polynomial Bound for Untangling Geometric Planar Graphs.
Electron. Notes Discret. Math., 2008

Editorial.
Comput. Geom., 2008

On local transformations in plane geometric graphs embedded on small grids.
Comput. Geom., 2008

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks.
Ad Hoc Sens. Wirel. Networks, 2008

Dynamic optimality for skip lists and B-trees.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Isometric Morphing of Triangular Meshes.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Smallest enclosing circle centered on a query line segment.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Simultaneous diagonal flips in plane triangulations.
Journal of Graph Theory, 2007

Posture Invariant Correspondence of Incomplete Triangular Manifolds.
Int. J. Shape Model., 2007

A General Approximation Algorithm for Planar Maps with Applications.
Int. J. Comput. Geom. Appl., 2007

Geodesic Ham-Sandwich Cuts.
Discret. Comput. Geom., 2007

Space-efficient geometric divide-and-conquer algorithms.
Comput. Geom., 2007

On the stabbing number of a random Delaunay triangulation.
Comput. Geom., 2007

Reconfiguring Triangulations with Edge Flips and Point Moves.
Algorithmica, 2007

On Generalized Diamond Spanners.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Optimal Point Set Partitioning using Rigid Motion Star Placement.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Approximations of Geodesic Distances for Incomplete Triangular Manifolds.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Linear-Space Algorithms for Distance Preserving Embedding.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Vertex Pops and Popturns.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons.
SIAM J. Discret. Math., 2006

Area-preserving approximations of polygonal paths.
J. Discrete Algorithms, 2006

Partitions of complete geometric graphs into plane trees.
Comput. Geom., 2006

Equitable subdivisions within polygonal regions.
Comput. Geom., 2006

Induced Subgraphs of Bounded Degree and Bounded Treewidth.
Contributions Discret. Math., 2006

Feature-based cut detection with automatic threshold selection.
Proceedings of the 2006 TREC Video Retrieval Evaluation, 2006

Persistent realtime building interior generation.
Proceedings of the 2006 ACM SIGGRAPH symposium on Videogames, 2006

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

On the Stretch Factor of the Constrained Delaunay Triangulation.
Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

Diamond Triangulations Contain Spanners of Bounded Degree.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Lazy Generation of Building Interiors in Realtime.
Proceedings of the Canadian Conference on Electrical and Computer Engineering, 2006

Optimal Polygon Placement.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Computing the Tool Path of an Externally Monotone Polygon in Linear Time.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Optimizing a constrained convex polygonal annulus.
J. Discrete Algorithms, 2005

Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra.
Int. J. Comput. Geom. Appl., 2005

Guest Editors' Foreword.
Algorithmica, 2005

Constructing Plane Spanners of Bounded Degree and Low Weight.
Algorithmica, 2005

Temporal Synchronization of Video Sequences in Theory and in Practice.
Proceedings of the 7th IEEE Workshop on Applications of Computer Vision / IEEE Workshop on Motion and Video Computing (WACV/MOTION 2005), 2005

Approximate Range Mode and Range Median Queries.
Proceedings of the STACS 2005, 2005

High-speed texture-preserving digital image inpainting.
Proceedings of the Signal and Image Processing (SIP 2005), 2005

On properties of higher-order Delaunay graphs with applications.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Translating a Star over a Point Set.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Competitive online routing in geometric graphs.
Theor. Comput. Sci., 2004

Online Routing in Triangulations.
SIAM J. Comput., 2004

The Maximum Number of Edges in a Three-Dimensional Grid-Drawing.
J. Graph Algorithms Appl., 2004

Packing two disks into a polygonal environment.
J. Discrete Algorithms, 2004

Light edges in degree-constrained graphs.
Discret. Math., 2004

Approximating geometric bottleneck shortest paths.
Comput. Geom., 2004

Ordered theta graphs.
Comput. Geom., 2004

On simplifying dot maps.
Comput. Geom., 2004

Testing the Quality of Manufactured Disks and Balls.
Algorithmica, 2004

Weighted Ham-Sandwich Cuts.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

On computing enclosing isosceles triangles and related problems.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Computing nice sweeps for polyhedra and polygons.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Asymmetric Communication Protocols via Hotlink Assignments.
Theory Comput. Syst., 2003

Properties of Arrangement Graphs.
Int. J. Comput. Geom. Appl., 2003

Fast approximations for sums of distances, clustering and the Fermat-Weber problem.
Comput. Geom., 2003

Translating a regular grid over a point set.
Comput. Geom., 2003

Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces.
Comput. Geom., 2003

Bounds for Frequency Estimation of Packet Streams.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002
Station Layouts in the Presence of Location Constraints.
J. Interconnect. Networks, 2002

Finding Specified Sections of Arrangements: 2D Results.
J. Math. Model. Algorithms, 2002

An Improved Algorithm for Subdivision Traversal without Extra Storage.
Int. J. Comput. Geom. Appl., 2002

Diamonds are Not a Minimum Weight Triangulation's Best Friend.
Int. J. Comput. Geom. Appl., 2002

Online Routing in Convex Subdivisions.
Int. J. Comput. Geom. Appl., 2002

Efficient visibility queries in simple polygons.
Comput. Geom., 2002

On embedding an outer-planar graph in a point set.
Comput. Geom., 2002

Experimental results on quadrangulations of sets of fixed points.
Comput. Aided Geom. Des., 2002

Separating an object from its cast.
Comput. Aided Des., 2002

Some Aperture-Angle Optimization Problems.
Algorithmica, 2002

Facility Location Constrained to a Polygonal Domain.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Succinct Data Structures for Approximating Convex Functions with Applications.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks.
Wirel. Networks, 2001

Efficient Algorithms for Petersen's Matching Theorem.
J. Algorithms, 2001

Every Set of Disjoint Line Segments Admits a Binary Tree.
Discret. Comput. Geom., 2001

The Grid Placement Problem.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

2000
Strategies for Hotlink Assignments.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Flipping your Lid.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Drawing Nice Projections of Objects in Space.
J. Vis. Commun. Image Represent., 1999

Testing the Quality of Manufactured Balls.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Optimizing Constrained Offset and Scaled Polygonal Annuli.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

Near optimal-partitioning of rectangles and prisms.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
A Visibility Representation for Graphs in Three Dimensions.
J. Graph Algorithms Appl., 1998

Pattern Matching for Permutations.
Inf. Process. Lett., 1998

Intersections with random geometric objects.
Comput. Geom., 1998

Filling polyhedral molds.
Comput. Aided Des., 1998

Computing constrained minimum-width annuli of point sets.
Comput. Aided Des., 1998

Algorithms for Packing Two Circles in a Convex Polygon.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Polygon Cutting: Revisited.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Testing the Quality of Manufactured Disks and Cylinders.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Cutting rectangles in equal area pieces.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Detection of text-line orientation.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Recovering lines with fixed linear probes.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Optimal Algorithms to Embed Trees in a Point Set.
J. Graph Algorithms Appl., 1997

The Floodlight Problem.
Int. J. Comput. Geom. Appl., 1997

Guarding Polyhedral Terrains.
Comput. Geom., 1997

Characterizing and efficiently computing quadrangulations of planar point sets.
Comput. Aided Geom. Des., 1997

Determining the Castability of Simple Polyhedra.
Algorithmica, 1997

Feasibility of Design in Stereolithography.
Algorithmica, 1997

1996
All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers.
Comput. Geom., 1996

Characterizing Proximity Trees.
Algorithmica, 1996

On Rectangle Visibility Graphs.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

On the Sectional Area of Convex Polytopes.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application.
Proceedings of the Computer Graphics International Conference, 1996

Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Approximating Shortest Paths in Arrangements of Lines.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

The Complexity of Rivers in Triangulated Terrains.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Growing a Tree from Its Branches.
J. Algorithms, 1995

Geometric and computational aspects of gravity casting.
Comput. Aided Des., 1995

No Quadrangulation is Extremely Odd.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Aperture angle optimization problems.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
Geometric and computational aspects of manufacturing processes.
Comput. Graph., 1994

Proximity Constraints and Representable Trees.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

K-Guarding Polygons on the Plane.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Feasability of Design in Stereolithography.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993


  Loading...