Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
7
click to vote
CCCG
2003
favorite
Email
discuss
report
77
views
Computational Geometry
»
more
CCCG 2003
»
Planar case of the maximum box and related problems
13 years 6 months ago
Download
web.cs.dal.ca
Ying Liu, Mikhail Nediak
Real-time Traffic
CCCG 2003
|
CCCG 2007
|
claim paper
Related Content
»
Maximum Flow in Directed Planar Graphs with Vertex Capacities
»
Linear Problem Kernels for NPHard Problems on Planar Graphs
»
Finding Steiner Forests in Planar Graphs
»
Maximum Flows and Parametric Shortest Paths in Planar Graphs
»
Maximum kChains in Planar Point Sets Combinatorial Structure and Algorithms
»
On the global optimum of planar rangebased robottorobot relative pose estimation
»
From Interval Computations to ConstraintRelated Set Computations Towards Faster Estimation...
»
Partition into cliques for cubic graphs Planar case complexity and approximation
»
Sets of Points Determining Only Acute Angles and Some Related Colouring Problems
more »
Post Info
More Details (n/a)
Added
31 Oct 2010
Updated
31 Oct 2010
Type
Conference
Year
2003
Where
CCCG
Authors
Ying Liu, Mikhail Nediak
Comments
(0)
Researcher Info
Computational Geometry Study Group
Computer Vision