会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Method and apparatus for a display producing a fixed set of images
    • 用于产生固定图像组的显示器的方法和装置
    • US06486861B1
    • 2002-11-26
    • US09306752
    • 1999-05-07
    • Bryan T. PreasHelen M. Davis
    • Bryan T. PreasHelen M. Davis
    • G09G336
    • G09G3/04Y10T428/24802
    • A method to greatly simplify and reduce the cost of displays when all of the images that need to be displayed are known beforehand. By precomputing the intersections of the images and addressing the intersections of the images, the number of drivers that are required becomes a function of the number of images rather than a function of the resolution. For example, four arbitrarily complex, overlapping images require, at most, 16 drivers. In general, n arbitrarily complex, overlapping images require, at most, 2n drivers. This result holds irrespective of the size of the display or the complexity resolution, or amount of overlap of the images. Further reduction of the number of drivers is possible if some of the images do not overlap some of the other images. For example, two images overlap each other in one area and two other images may overlap each other in a separate area while the two sets of images do not themselves overlap. In this case, at most eight drivers are needed instead of the 16 drivers that would be required if all four of the images overlapped each other. In general, if you consider N separate, distinct areas, each with a set of overlapping images where ni images overlap in area i (ie, n1 images that overlap in area 1, n2 images that overlap in area 2, etc.). Then the maximum number of drivers that are required will be summation for i from 1 to N of 2 raised to the power of ni.
    • 当预先知道需要显示的所有图像时,大大简化和降低显示器成本的方法。 通过预先计算图像的交点和寻址图像的交点,所需的驱动器数量成为图像数量的函数,而不是分辨率的函数。 例如,四个任意复杂的重叠图像最多需要16个驱动程序。 一般来说,n个任意复杂的重叠图像最多需要2n个驱动程序。 无论显示器的尺寸或复杂性分辨率或图像的重叠量如何,该结果都将成立。 如果某些图像不与其他图像重叠,则可以进一步减少驱动器的数量。 例如,两个图像在一个区域中彼此重叠,并且另外两个图像可以在单独的区域中彼此重叠,而两组图像本身不重叠。 在这种情况下,最多需要8个驱动程序,而不是所有4个映像重叠的16个驱动程序。 一般来说,如果您考虑N个独立的不同区域,每个区域具有一组重叠图像,其中ni图像在区域i中重叠(即,区域1中重叠的n1个图像,区域2中重叠的n2个图像等)。 那么所需的最大驱动程序数将是i从1到N的2的总和提高到ni的幂。