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
37
click to vote
JCDCG
2000
Springer
favorite
Email
discuss
report
86
views
Discrete Geometry
»
more
JCDCG 2000
»
Generalized Balanced Partitions of Two Sets of Points in the Plane
14 years 4 months ago
Download
gorogoro.cis.ibaraki.ac.jp
We consider the following problem. Let n 2, b 1 and q 2 be integers. Let R and B be two disjoint sets of n red points and bn blue points in the plane, respectively, such that no three points of RB lie on the same line. Let n = n1 + n2 +
Atsushi Kaneko, Mikio Kano
Real-time Traffic
Bn Blue Points
|
Discrete Geometry
|
Disjoint Sets
|
JCDCG 2000
|
Red Points
|
claim paper
Post Info
More Details (n/a)
Added
25 Aug 2010
Updated
25 Aug 2010
Type
Conference
Year
2000
Where
JCDCG
Authors
Atsushi Kaneko, Mikio Kano
Comments
(0)
Researcher Info
Discrete Geometry Study Group
Computer Vision